Coprimitive sets and inextendable codes
- 14 July 2007
- journal article
- Published by Springer Nature in Designs, Codes and Cryptography
- Vol. 47 (1-3) , 113-124
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Maximum distance separable codes and arcs in projective spacesJournal of Combinatorial Theory, Series A, 2006
- Bounds on -arcs and their application to linear codesFinite Fields and Their Applications, 2005
- The number of directions determined by a function over a finite fieldJournal of Combinatorial Theory, Series A, 2003
- On the Number of Slopes of the Graph of a Function Defined on a Finite FieldJournal of Combinatorial Theory, Series A, 1999
- Optimal ternary linear codesDesigns, Codes and Cryptography, 1992
- On extendable planes, M.D.S. codes and hyperovals in PG(2, q), q=2 tGeometriae Dedicata, 1988
- A Theorem on Permutations of a Finite FieldCanadian Journal of Mathematics, 1973
- Some maximal arcs in finite projective planesJournal of Combinatorial Theory, 1969
- Finite nets. II. Uniqueness and imbeddingPacific Journal of Mathematics, 1963
- A Bound for Error-Correcting CodesIBM Journal of Research and Development, 1960