Distance-spectrum formulas on the largest minimum distance of block codes

DOI10.1109/18.841167zbMATH Open0998.94045OpenAlexW2104553637MaRDI QIDQ4503579FDOQ4503579

Authors: Poning Chen, Tzong-Yow Lee, Yunghsiang Sam Han 

Publication date: 7 September 2000

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

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

Recommendations

• Estimates of the distance distribution of codes and designs
• Estimates of the distance distribution of codes and designs
• Asymptotic minimum covering radius of block codes
• Upper bounds on generalized distances
• Upper bounds on the cardinality of a binary code with a given minimum distance

zbMATH Keywords

asymptotic largest minimum distancedeterministic block codesVarshamov-Gilbert lower bound

Mathematics Subject Classification ID

Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40)

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Distance-spectrum formulas on the largest minimum distance of block codes

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