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 - McNamara - Document - PDFSEARCH.IO

First Page	Meta Content
	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 Add to Reading List Document Date: 2013-07-01 22:40:26 Open Document File Size: 126,70 KB Share Result on Facebook City New York / / Company Oxford University Press / / / Facility Hall Polynomials / / Organization Oxford University / / Person PETER J. MCNAMARA / / ProgrammingLanguage R / C / / ProvinceOrState New York / / PublishedMedium IEEE Transactions on Information Theory / / SocialTag Mathematical analysis Field theory Finite field Differential operators Number theory Coding theory Wozencraft ensemble Genus of a multiplicative sequence Abstract algebra Mathematics

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 lAdd to Reading List