The DOI matches its Crossref record.
New array codes for multiple phased burst correction
Abstract
An optimal family of array codes over GF(q) for correcting multiple phased burst errors and erasures, where each phased burst corresponds to an erroneous or erased column in a code array, is introduced. As for erasures, these array codes have an efficient decoding algorithm which avoids multiplications (or divisions) over extension fields, replacing these operations with cyclic shifts of vectors over GF(q). The erasure decoding algorithm can be adapted easily to handle single column errors as well. The codes are characterized geometrically by means of parity constraints along certain diagonal lines in each code array, thus generalizing a previously known construction for the special case of two erasures. Algebraically, they can be interpreted as Reed-Solomon codes. When q is primitive in GF(q), the resulting codes become (conventional) Reed-Solomon codes of length P over GF(q/sup p-1/), in which case the new erasure decoding technique can be incorporated into the Berlekamp-Massey algorithm, yielding a faster way to compute the values of any prescribed number of errors.>
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
EVENODD: an efficient scheme for tolerating double disk failures in RAID architectures
Blaum, M., Brady, J., Bruck, J., & Menon, J. (1995) · IEEE Transactions on Computers · doi:10.1109/12.364531 · Cited by 689
Self-citationSTAR : An Efficient Coding Scheme for Correcting Triple Storage Node Failures
Huang, C., & Xu, L. (2008) · IEEE Transactions on Computers · doi:10.1109/tc.2007.70830 · Cited by 257
XOR-Based FEC to Improve Burst-Loss Tolerance for 8K Ultra-High Definition TV over IP Transmission
Kawamoto, J., & Kurakake, T. (2017) · GLOBECOM 2017 - 2017 IEEE Global Communications Conference · doi:10.1109/glocom.2017.8254125 · Cited by 10
Metadata
- Authors
- Blaum, M., & Roth, R. M.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1993
- Volume
- 39
- Issue
- 1
- Pages
- 66-77
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2114197496
- Cited by
- 187
- References
- 0
- FWCI
- 3.46
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: New array codes for multiple phased burst correction. https://app.cochat.ai/papers/10.1109/18.179343
- The paper
- Blaum, M., & Roth, R. M. (1993). New array codes for multiple phased burst correction. IEEE Transactions on Information Theory. https://doi.org/10.1109/18.179343
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.