Linear covering codes and error-correcting codes for limited-magnitude errors
DOI10.1007/S10623-013-9917-1zbMath1300.11075DBLPjournals/dcc/KloveS14OpenAlexW1994368595WikidataQ59902828 ScholiaQ59902828MaRDI QIDQ398936
Publication date: 18 August 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9917-1
Linear codes (general theory) (94B05) Bounds on codes (94B65) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Lattice packing and covering (number-theoretic aspects) (11H31) Applications of the theory of convex sets and geometry of numbers (covering radius, etc.) to coding theory (94B75) Combinatorial aspects of packing and covering (05B40)
Related Items (2)
Cites Work
- Lattice covering by semicrosses of arm length 2
- Tiling, packing, and covering by clusters
- On the non-existence of lattice tilings by quasi-crosses
- Covering Sets for Limited-Magnitude Errors
- Codes Correcting Single Errors of Limited Magnitude
- Quasi-Cross Lattice Tilings With Applications to Flash Memory
- Some Codes Correcting Asymmetric Errors of Limited Magnitude
- Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories
- Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
- Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories
- Trajectory Codes for Flash Memory
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Linear covering codes and error-correcting codes for limited-magnitude errors