Asymmetric Single Magnitude Four Error Correcting Codes

2019/03/04 by Xie, Derong, Luo, Jinquan · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1903.01148

Abstract

Limited magnitude asymmetric error model is well suited for flash memory. In this paper, we consider the construction of asymmetric codes correcting single error over ℤ_2^kr and which are based on so called B₁[4](2^kr) set. In fact, we reduce the construction of a maximal size B₁[4](2^kr) set for k≥3 to the construction of a maximal size B₁[4](2^k-3r) set. Finally, we give a explicit formula of a maximal size B₁[4](4r) set and some lower bounds of a maximal size B₁[4](2r) set. By computer searching up to q≤106, we conjecture that those lower bounds are tight.

Cited by

• On lattice tilings of ℤⁿ by limited magnitude error balls B(n,2,k₁,k₂) with k₁>k₂

Related

• Correcting Codes for Asymmetric Single Magnitude Four Error
• On the Existence of Perfect Codes for Asymmetric Limited-Magnitude Errors
• Codes correcting restricted errors
• A Constrained Coding Scheme for Correcting Asymmetric Magnitude-1 Errors in q-ary Channels
• Minimizing the alphabet size in codes with restricted error sets