A reduced upper bound on the error correction ability of codes (Corresp.)
From MaRDI portal
Publication:5733051
DOI10.1109/TIT.1963.1057806zbMATH Open0121.36903OpenAlexW2124826072MaRDI QIDQ5733051
Publication date: 1963
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.1963.1057806
Related Items (6)
Codes of length two correcting single errors of limited size ⋮ Lower bounds on achievable rates for limited bitshift correcting codes ⋮ Lower bounds for the cardinality of error-correcting codes in channels with multiple access ⋮ Singleton-type bounds for blot-correcting codes ⋮ Griffith–Kelly–Sherman Correlation Inequalities: A Useful Tool in the Theory of Error Correcting Codes ⋮ On lower bounds for the redundancy of optimal codes
This page was built for publication: A reduced upper bound on the error correction ability of codes (Corresp.)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5733051)
