Projects per year
Abstract
For a linear code C of length n with dimension k and minimum distance d, it is desirable that the quantity kd/n is large. Given an arbitrary field F, we introduce a novel, but elementary, construction that produces a recursively defined sequence of Flinear codes (formula presented) with parameters (formula presented) grows quickly in the sense that (formula presented). Another example of quick growth comes from a certain subsequence of ReedMuller codes. Here the field is F = F_{2} and k_{i}d_{i}/n_{i} is asymptotic to (formula presented).
Original language  English 

Pages (fromto)  105113 
Number of pages  9 
Journal  Journal of Algebra Combinatorics Discrete Structures and Applications 
Volume  10 
Issue number  2 
DOIs  
Publication status  Published  10 May 2023 
Fingerprint
Dive into the research topics of 'Sequences of linear codes where the rate times distance grows rapidly'. Together they form a unique fingerprint.Projects
 1 Finished

Complexity of group algorithms and statistical fingerprints of groups
Praeger, C. & Niemeyer, A.
21/02/19 → 31/12/22
Project: Research