Correcting Codes for Asymmetric Single Magnitude Four Error

2019/05/05 by Xie, Derong, Luo, Jinquan
#Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1905.02570

Abstract

An error model with asymmetric single magnitude four error is considered. This paper is about constructions of codes correcting single error over ℤ_2^a3^br. Firstly, we reduce the construction of a maximal size B₁[4](2^a3^br) set for a≥4 and gcd(r,6)=1 to the construction of a maximal size B₁[4](2^a-33^br) set. Further, we will show that maximal size B₁[4](8⋅3^br) sets can be reduced to maximal size B₁[4](3^br) sets. Finally, we give a lower bounds of maximal size B₁[4](2r) and B₁[4](2⋅3^br) sets.

Related

• Asymmetric Single Magnitude Four Error Correcting Codes
• Cross-Error Correcting Integer Codes over ℤ_2^m
• Minimizing the alphabet size in codes with restricted error sets
• Linear Binary Codes Correcting One or More Errors
• On Bounded-Weight Error-Correcting Codes