Codes correcting restricted errors

DOI10.1007/S10623-018-0585-ZzbMATH Open1443.94107arXiv1811.03375OpenAlexW2899870153WikidataQ128815754 ScholiaQ128815754MaRDI QIDQ670208FDOQ670208

Authors: Igor E. Shparlinski, Arne Winterhof 

Publication date: 18 March 2019

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: We study the largest possible length $B$ of $(B-1)$-dimensional linear codes over $mathbb{F}_q$ which can correct up to $t$ errors taken from a restricted set $mathcalAsubseteqmathbb{F}_q^{\ast }$. Such codes can be applied to multilevel flash memories. Moreover, in the case that $q=p$ is a prime and the errors are limited by a constant we show that often the primitive $ell$th roots of unity, where $ell$ is a prime divisor of $p-1$, define good such codes.

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

Recommendations

• Restricted \(b_i\)-byte correcting non-binary optimal codes
• Codes of length 2 correcting single errors of limited size
• Codes of length two correcting single errors of limited size. II
• scientific article; zbMATH DE number 3478754
• Codes of length two correcting single errors of limited size

zbMATH Keywords

linear codespacking setsrestricted errors

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites Work

• Title not available (Why is that?)
• The difference between consecutive primes. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• PRIMES is in P
• Some Codes Correcting Asymmetric Errors of Limited Magnitude
• Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories
• Some Codes Correcting Unbalanced Errors of Limited Magnitude for Flash Memories
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bounds for resultants of univariate and bivariate polynomials
• A class of codes for asymmetric channels and a problem from the additive theory of numbers
• Sum-product estimates applied to Waring's problem mod \(p\)
• Algebraic coding theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating random factored numbers, easily
• How to Generate Factored Random Numbers
• Waring's number for large subgroups of \(\mathbb Z_p^*\)
• Heilbronn's conjecture on Waring's number (mod \(p\))

Cited In (6)

• Codes of length 2 correcting single errors of limited size
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized bidirectional limited magnitude error correcting code for MLC flash memories
• Hierarchical erasure correction of linear codes
• Codes of length two correcting single errors of limited size. II

This page was built for publication: Codes correcting restricted errors

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