Asymptotically optimal binary codes of polynomial complexity correcting localized errors

zbMATH Open0901.94036MaRDI QIDQ1925359FDOQ1925359

Authors: L. A. Bassalygo, M. S. Pinsker, Rudolf Ahlswede 

Publication date: 19 August 1998

Published in: Problems of Information Transmission (Search for Journal in Brave)

Recommendations

• Asymptotically optimal codes correcting multiple localized bursts
• Binary constant-weight codes correcting localized errors
• Binary constant-weight codes correcting localized errors and defects

zbMATH Keywords

asymptotically optimal transmission ratecodes with polynomial complexity

Mathematics Subject Classification ID

Other types of codes (94B60)

Cited In (5)

• Linear-time binary codes correcting localized erasures
• Localized random and arbitrary errors in the light of arbitrarily varying channel theory
• Title not available (Why is that?)
• Asymptotically optimal linear codes correcting defects of linearly increasing multiplicity
• Good polynomials for optimal LRC of low locality

This page was built for publication: Asymptotically optimal binary codes of polynomial complexity correcting localized errors

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