AN UPPER BOUND ON THE NUMBER OF PARITY CHECKS FOR BURST ERROR DETECTION AND CORRECTION IN EUCLIDEAN CODES

From MaRDI portal

Revision as of 17:02, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3398634

Jump to:navigation, search

DOI10.4134/JKMS.2009.46.5.967zbMath1170.94341OpenAlexW1991393399MaRDI QIDQ3398634

Lee, Kisuk, Sapna Jain

Publication date: 29 September 2009

Published in: Journal of the Korean Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4134/jkms.2009.46.5.967

zbMATH Keywords

linear codes minimum distance Euclidean weight burst errors

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Related Items (1)

Singleton's Bound in Euclidean Codes

This page was built for publication: AN UPPER BOUND ON THE NUMBER OF PARITY CHECKS FOR BURST ERROR DETECTION AND CORRECTION IN EUCLIDEAN CODES

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3398634&oldid=16675891"