Recursive constructions of complete caps
- 1 May 2001
- journal article
- Published by Elsevier in Journal of Statistical Planning and Inference
- Vol. 95 (1-2) , 167-173
- https://doi.org/10.1016/s0378-3758(00)00286-x
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- New Linear Codes with Covering Radius 2 and Odd BasisDesigns, Codes and Cryptography, 1999
- The packing problem in statistics, coding theory and finite projective spacesJournal of Statistical Planning and Inference, 1998
- Correction to "Covering Radii Of Ternary Linear Codes Of Small Dimensions And Codimensions"IEEE Transactions on Information Theory, 1998
- Projective Geometries over Finite FieldsPublished by Oxford University Press (OUP) ,1998
- Covering radii of ternary linear codes of small dimensions and codimensionsIEEE Transactions on Information Theory, 1997
- Small Complete Caps in Spaces of Even CharacteristicJournal of Combinatorial Theory, Series A, 1996
- Linear codes with covering radius 2 and other new covering codesIEEE Transactions on Information Theory, 1991
- Lower bounds on mt(r, s)Journal of Combinatorial Theory, Series A, 1978