Grant: Discovery Grants Program - Individual
Wilfrid Laurier University
$15,000.00
Algorithms in algebraic combinatorial design theory
FY 2006-07
Summary
Combinatorial Designs are used in every day life, even though this is not always visible. Satellite transmissions use Error-correcting codes which are based on certain special kinds of combinatorial designs. Wireless communication protocols use combinatorial designs as well. The theory of combinatorial designs uses extensively tools from Mathematics (from areas such as Linear Algebra, Group Theory, Number Theory) and Computer Science (from areas such as Algorithms, High-performance computing, Metaheuristics). The main focus of our project is the study of combinatorial designs from a Computational Algebra point of view. Formalizing combinatorial designs via Computational Algebra allows one to employ powerful techniques to study them. An important outcome of our project is the creation of databases with inequivalent designs. These databases are available to statisticians and other researchers.
Program
Discovery Grants Program - Individual
Recipient
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
249875-2006
Name nom
Kotsireas, Ilias
Department département
Physics and Computer Science
Organization id
35
Institution établissement
Wilfrid Laurier University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2006
Competition year année de concours
2006
Award amount
15000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
Area of application code
800
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Information and communication services
Area of application fr
Services d'information et de télécommunications
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
5
Application title
Algorithms in algebraic combinatorial design theory
Keyword
NA
Application summary
Combinatorial Designs are used in every day life, even though this is not always visible. Satellite transmissions use Error-correcting codes which are based on certain special kinds of combinatorial designs. Wireless communication protocols use combinatorial designs as well. The theory of combinatorial designs uses extensively tools from Mathematics (from areas such as Linear Algebra, Group Theory, Number Theory) and Computer Science (from areas such as Algorithms, High-performance computing, Metaheuristics). The main focus of our project is the study of combinatorial designs from a Computational Algebra point of view. Formalizing combinatorial designs via Computational Algebra allows one to employ powerful techniques to study them. An important outcome of our project is the creation of databases with inequivalent designs. These databases are available to statisticians and other researchers.
