Limiting efficiencies of burst-correcting array codes
From MaRDI portal
Publication:3360803
DOI10.1109/18.86991zbMATH Open0733.94021OpenAlexW2170453519MaRDI QIDQ3360803
Publication date: 1991
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.86991
Related Items (4)
On the Efficiency of Shortened Cyclic Single-Burst-Correcting Codes ⋮ A fast algorithm to determine the burst-correcting limit of cyclic or shortened cyclic codes ⋮ Limitations on Testable Affine-Invariant Codes in the High-Rate Regime ⋮ Weakly biased arrays, almost independent arrays and error-correcting codes
This page was built for publication: Limiting efficiencies of burst-correcting array codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3360803)
