Class of constructive asymptotically good algebraic codes
The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
For any rateR, 0 < R < 1, a sequence of specific(n,k)binary codes with rateR_n > Rand minimum distancedis constructed such that \begin{equation} \lim_{n \rightarrow \infty} \inf \frac{d}{n} \geq (1 - r ^{-1} R)H^{-1} (1 - r)> 0 \end{equation} (and hence the codes are asymptotically good), whereris the maximum of\frac{1}{2}and the solution of \begin{equation} R = \frac{r^2}{1 + \log_2 [1 - H^{-1}(1 - r)]}. \end{equation} The codes are extensions of the Reed-Solomon codes overGF(2^m)With a simple algebraic description of the added digits. Alternatively, the codes are the concatenation of a Reed-Solomon outer code of lengthN = 2^m - 1withNdistinct inner codes, namely all the codes in Wozeneraft's ensemble of randomly shifted codes. A decoding procedure is given that corrects all errors guaranteed correctable by the asymptotic lower bound ond. This procedure can be carried out by a simple decoder which performs approximatelyn^2 \log ncomputations.
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
Cites
Polynomial Codes Over Certain Finite Fields
Reed, I. S., & Solomon, G. (1960) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0108018 · Cited by 3,662
Cattermole, K. W. (1968) · Electronics and Power · doi:10.1049/ep.1968.0141 · Cited by 1,319
Mann, H. B. (1961) · Technometrics · doi:10.1080/00401706.1961.10489978 · Cited by 1,069
A Comparison of Signalling Alphabets
Gilbert, E. N. (1952) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1952.tb01393.x · Cited by 522
SAKATA, S. (2008) · IEICE ESS Fundamentals Review · doi:10.1587/essfr.1.3_44 · Cited by 347
Cited by
Buhrman, H., Cleve, R., Watrous, J., & de Wolf, R. (2001) · Physical Review Letters · doi:10.1103/physrevlett.87.167902 · Cited by 1,190
Bit commitment using pseudorandomness
Naor, M. (1991) · Journal of Cryptology · doi:10.1007/bf00196774 · Cited by 807
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Small-Bias Probability Spaces: Efficient Constructions and Applications
Naor, J., & Naor, M. (1993) · SIAM Journal on Computing · doi:10.1137/0222053 · Cited by 560
Blake, I., Heegard, C., Hoholdt, T., & Wei, V. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.720550 · Cited by 265
One way functions and pseudorandom generators
Levin, L. A. (1987) · Combinatorica · doi:10.1007/bf02579323 · Cited by 257
Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
Alon, N., Bruck, J., Naor, J., Naor, M., & Roth, R. M. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119713 · Cited by 257
Generating quasi-random sequences from semi-random sources
Santha, M., & Vazirani, U. V. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90044-9 · Cited by 256
Swap test and Hong–Ou–Mandel effect are equivalent
Garcia-Escartin, J. C., & Chamorro-Posada, P. (2013) · Physical Review A · doi:10.1103/physreva.87.052330 · Cited by 182
Extracting Randomness via Repeated Condensing
Reingold, O., Shaltiel, R., & Wigderson, A. (2006) · SIAM Journal on Computing · doi:10.1137/s0097539703431032 · Cited by 39
Metadata
- Authors
- Justesen, J.
- Venue
- IEEE Transactions on Information Theory
- Published
- 1972-09
- Volume
- 18
- Issue
- 5
- Pages
- 652-656
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2014860393
- Cited by
- 294
- References
- 5
- FWCI
- 8.48
- 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
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.