Constructing Good Covering Codes for Applications in Steganography
- 26 May 2008
- book chapter
- Published by Springer Nature
- Vol. 3, 1-22
- https://doi.org/10.1007/978-3-540-69019-1_1
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- Nordstrom–Robinson code and A7-geometryFinite Fields and Their Applications, 2007
- Minimal 1-saturating sets and complete caps in binary projective spacesJournal of Combinatorial Theory, Series A, 2006
- Locally Optimal (Nonshortening) Linear Covering Codes and Minimal Saturating Sets in Projective SpacesIEEE Transactions on Information Theory, 2005
- Quasi-Perfect Codes With Small DistanceIEEE Transactions on Information Theory, 2005
- New covering codes from an ADS-like constructionIEEE Transactions on Information Theory, 2003
- A Coloring Problem in Hamming SpacesEuropean Journal of Combinatorics, 1997
- The Z/sub 4/-linearity of Kerdock, Preparata, Goethals, and related codesIEEE Transactions on Information Theory, 1994
- Constructions for perfect mixed codes and other covering codesIEEE Transactions on Information Theory, 1993
- On (k, t)-subnormal covering codesIEEE Transactions on Information Theory, 1991
- Linear codes with covering radius 2 and other new covering codesIEEE Transactions on Information Theory, 1991