Constructions and families of nonbinary linear codes with covering radius 2
- 1 July 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (5) , 1679-1686
- https://doi.org/10.1109/18.771244
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Constructions of codes with covering radius 2Published by Springer Nature ,2005
- The packing problem in statistics, coding theory and finite projective spacesJournal of Statistical Planning and Inference, 1998
- Constructions and families of covering codes and saturated sets of points in projective geometryIEEE Transactions on Information Theory, 1995
- Constructions, families, and tables of binary linear covering codesIEEE Transactions on Information Theory, 1994
- Some Optimal Codes from Algebraic Geometry and Their Covering RadiiEuropean Journal of Combinatorics, 1990
- Short codes with a given covering radiusIEEE Transactions on Information Theory, 1989
- Saturated Configurations of Points in Projective Galois SpacesEuropean Journal of Combinatorics, 1987
- MAXIMUM SETS IN FINITE PROJECTIVE SPACESPublished by Cambridge University Press (CUP) ,1983