Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of British Columbia

$33,165.00

Entropy rate of hidden markov chains and capacity and coding for input-constrained channels

FY 2008-09

Summary
In many practical noisy channels, input sequences are constrained in order to enable the channel to operate effectively. For instance, in magnetic and optical recording channels input sequences are constrained in a variety of ways to ensure accurate timing and reduce the likelihood of certain kinds of error events. Input constraints also model memory that is typically present in data recording channels and band-limited communication channels. For many of the most important input-constrained channels, there is no explicit formula known for capacity, which is defined as the maximal rate at which information can be transmitted without error. We plan to focus on two main themes for input-constrained channels: 1) estimates and asymptotics for capacity of input-constrained channels and 2) construction of good codes for such channels. For 1), we will investigate estimates and asymptotics for entropy rate of Hidden Markov chains, and apply this to capacity of input-constrained channels. For 2), we will focus on coding schemes that limit error propagation and coding schemes that combine input constraints with error correction.
Program
Discovery Grants Program - Individual
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
261611-2007
Name nom
Marcus, Brian
Department département
Mathematics
Organization id
2
Institution établissement
University of British Columbia
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2007
Award amount
33165
Program id
RGPIN
Program nane 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
334
Committee name en
Commun.,Computers & Components
Committee name fr
Communic.,ordin. et composants
Area of application code
805
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
Communications technologies (satellites, radar, etc.)
Area of application fr
Technologie des télécommunications (satellites, radar,etc.)
Research subject code
2959
Research subject group en
Applied mathematics
Research subject group fr
Mathématiques appliquées
Research subject en
Mathematics of communications
Research subject fr
Mathématiques des télécommunications
Partie
2
Nb partie
5
Application title
Entropy rate of hidden markov chains and capacity and coding for input-constrained channels
Keyword
NA
Application summary
In many practical noisy channels, input sequences are constrained in order to enable the channel to operate effectively. For instance, in magnetic and optical recording channels input sequences are constrained in a variety of ways to ensure accurate timing and reduce the likelihood of certain kinds of error events. Input constraints also model memory that is typically present in data recording channels and band-limited communication channels. For many of the most important input-constrained channels, there is no explicit formula known for capacity, which is defined as the maximal rate at which information can be transmitted without error. We plan to focus on two main themes for input-constrained channels: 1) estimates and asymptotics for capacity of input-constrained channels and 2) construction of good codes for such channels. For 1), we will investigate estimates and asymptotics for entropy rate of Hidden Markov chains, and apply this to capacity of input-constrained channels. For 2), we will focus on coding schemes that limit error propagation and coding schemes that combine input constraints with error correction.