Codes correcting restricted errors

DOI10.1007/s10623-018-0585-zzbMath1443.94107arXiv1811.03375OpenAlexW2899870153WikidataQ128815754 ScholiaQ128815754MaRDI QIDQ670208

Arne Winterhof, Igor E. Shparlinski

Publication date: 18 March 2019

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

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

zbMATH Keywords

linear codespacking setsrestricted errors

Mathematics Subject Classification ID

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

Cites Work

• Bounds for resultants of univariate and bivariate polynomials
• Heilbronn's conjecture on Waring's number (mod \(p\))
• PRIMES is in P
• Generating random factored numbers, easily
• The Difference Between Consecutive Primes, II
• How to Generate Factored Random Numbers
• Algebraic Coding Theory
• 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
• Waring's number for large subgroups of Z_p^*
• A class of codes for asymmetric channels and a problem from the additive theory of numbers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Codes correcting restricted errors