A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes

DOI10.1016/J.DISC.2020.111852zbMATH Open1448.94302OpenAlexW3008404456MaRDI QIDQ2174597FDOQ2174597

Authors: Takehiko Mori, Manabu Hagiwara 

Publication date: 21 April 2020

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2020.111852

Recommendations

• An improved bound on the fraction of correctable deletions
• scientific article; zbMATH DE number 5302391
• Some combinatorial constructions for optimal perfect deletion-correcting codes
• scientific article; zbMATH DE number 1867238
• On multiple insertion/deletion correcting codes

zbMATH Keywords

error-correcting codesperfect codesWeyl groupsenumerative combinatoricsbinary adjacent deletionsinsertion/deletion codes

Mathematics Subject Classification ID

Theory of error-correcting codes and error-detecting codes (94B99)

Cites Work

• Algebraic Combinatorics
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Brauer-Rademacher Identity
• A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes
• Reverse–Complement Similarity Codes

Cited In (2)

• An Asymptotic Formula in <inline-formula> <tex-math notation="TeX">\(q\) </tex-math></inline-formula> for the Number of <inline-formula> <tex-math notation="TeX">\([n, k]~q\) </tex-math></inline-formula>-Ary MDS Codes
• A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes

This page was built for publication: A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes

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