Singleton-type bounds for blot-correcting codes

DOI10.1109/18.490569zbMATH Open0876.94052OpenAlexW1982006686MaRDI QIDQ4887086FDOQ4887086

Authors: V. R. Sidorenko, Martin Bossert 

Publication date: 1 December 1997

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

Full work available at URL: https://doi.org/10.1109/18.490569

Recommendations

• Upper Bounds on the Number of Errors Corrected by a Convolutional Code
• scientific article; zbMATH DE number 493102
• Binary codes for compound channels (Corresp.)
• Error-Correction Capability of Binary Linear Codes
• An asymptotic bound on the distance of arithmetic codes
• Word correction by means of convolutional codes
• A reduced upper bound on the error correction ability of codes (Corresp.)
• Asymptotically optimal codes correcting multiple localized bursts
• On Bounded-Weight Error-Correcting Codes
• Codes that correct two-dimensional burst errors

zbMATH Keywords

bursts of errorscombinatorial metricblot-correcting codeslattice-pattern errorssingleton-type bounds

Mathematics Subject Classification ID

Bounds on codes (94B65) Burst-correcting codes (94B20) Other types of codes (94B60)

Cited In (2)

• Combinatorial metrics: MacWilliams-type identities, isometries and extension property
• Singleton bounds for codes over finite rings

This page was built for publication: Singleton-type bounds for blot-correcting codes

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