A LOWER BOUND ON THE SIZE OF BINARY CODES PETER J. MCNAMARA Abstract. In this paper, we construct some nonlinear binary codes that give good (but not optimally known) lower bounds on the size of binary codes with fixed l

Source URL: www.maths.usyd.edu.au

• Mathematical analysis
• Field theory
• Finite field
• Differential operators
• Number theory
• Coding theory
• Wozencraft ensemble
• Genus of a multiplicative sequence
• Abstract algebra
• Mathematics
• Error detection and correction