Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric

DOI10.1016/0020-0255(79)90033-1zbMath0442.94012OpenAlexW2070334005MaRDI QIDQ1143994

Manohar Lal Kaushik

Publication date: 1979

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(79)90033-1

zbMATH Keywords

number of parity checksclass metriccodes correcting random errors and burstsHamming sphere packingVarsharmov-Gilbert-Sacks bounds

Mathematics Subject Classification ID

Burst-correcting codes (94B20)

Cites Work

• Unnamed Item
• Unnamed Item
• BURST-ERROR-CORRECTING CODES WITH WEIGHT-CONSTRAINTS UNDER A NEW METRIC
• SINGLE ERROR AND BURST ERROR CORRECTING CODES THROUGH A NEW METRIC
• Error Detecting and Error Correcting Codes
• Low-density-burst-correcting codes (Corresp.)

This page was built for publication: Necessary and sufficient number of parity checks in codes correcting random errors and bursts with weight constraints under a new metric