Asymmetric Single Magnitude Four Error Correcting Codes

DOI10.1109/TIT.2020.2977625MaRDI QIDQ5124505zbMATH OpenOpenAlexFDO

Authors Derong Xie, Jinquan Luo

Publication date 29 September 2020

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.01148

zbMATH Keywords

construction of asymmetric codes correcting single error

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

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

m a t h b b Z_{2^{k} r}

and which are based on so called

B_{1} [4] (2^{k} r)

set. In fact, we reduce the construction of a maximal size

B_{1} [4] (2^{k} r)

set for

k g e q 3

to the construction of a maximal size

B_{1} [4] (2^{k - 3} r)

set. Finally, we give a explicit formula of a maximal size

B_{1} [4] (4 r)

set and some lower bounds of a maximal size

B_{1} [4] (2 r)

set. By computer searching up to

q l e q 106

, we conjecture that those lower bounds are tight.

Cited in

(1)

On lattice tilings of \(\mathbb{Z}^n\) by limited-magnitude error balls \(\mathcal{B}(n, 2, k_1, k_2)\) with \(k_1 > k_2\)

This page was built for publication: Asymmetric Single Magnitude Four Error Correcting Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124505)