On the Minimum/Stopping Distance of Array Low-Density Parity-Check Codes
- Submitting institution
-
University of Plymouth
- Unit of assessment
- 12 - Engineering
- Output identifier
- 49
- Type
- D - Journal article
- DOI
-
10.1109/TIT.2014.2333519
- Title of journal
- IEEE Transactions on Information Theory
- Article number
- -
- First page
- 5204
- Volume
- 60
- Issue
- 9
- ISSN
- 0018-9448
- Open access status
- Out of scope for open access requirements
- Month of publication
- -
- Year of publication
- 2014
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
2
- Research group(s)
-
-
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Array codes are highly performant LDPC codes with a strong algebraic structure. This highly cited and ground breaking paper establishes, for the first time, flexible and strong theoretical performance bounds on codes actually used in practice. The proposal is then validated using a very fast branch and bound search procedure for LDPC codes which has been co-developed at the University of Plymouth and the University of Bergen.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
