The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Permutation Decoding of Systematic Codes
Abstract
A symmetry of a systematic code is a permutation of bit positions in each code word (the same permutation is applied to all code words) which preserves the code as a whole. Permutation decoding makes use of these symmetries to build up a decoding algorithm for the code. It is difficult to find an appropriate set of symmetries for a code picked at random. For cyclic codes the problem is somewhat easier, and for some special cyclic codes it is solved completely in this paper. For these codes, at least, it is evident that permutation decoding is easy to implement and inexpensive compared with other decoding schemes. Permutation decoding as a n eans of error control is evaluated for the binary symmetric channel and for the switched telephone network as represented by experimental data. It is found to be extremely effective on the binary symmetric channel and of very doubtful value on the present telephone network.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
The use of information sets in decoding cyclic codes
Prange, E. (1962) · IEEE Transactions on Information Theory · doi:10.1109/tit.1962.1057777 · Cited by 463
Cited by
Algebraic Codes for Data Transmission
Blahut, R. E. (2003) · Cambridge University Press eBooks · doi:10.1017/cbo9780511800467 · Cited by 659
Generalized minimum distance decoding
Forney, G. (1966) · IEEE Transactions on Information Theory · doi:10.1109/tit.1966.1053873 · Cited by 565
Metadata
- Authors
- Macwilliams, J.
- Venue
- Bell System Technical Journal
- Published
- 1964-01
- Volume
- 43
- Issue
- 1
- Pages
- 485-505
- ISSN
- 0005-8580 (ISSN-L)
- OpenAlex
- W2070442620
- Cited by
- 166
- References
- 1
- FWCI
- 4.23
- 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: Permutation Decoding of Systematic Codes. https://app.cochat.ai/papers/10.1002/j.1538-7305.1964.tb04075.x
- The paper
- Macwilliams, J. (1964). Permutation Decoding of Systematic Codes. Bell System Technical Journal. https://doi.org/10.1002/j.1538-7305.1964.tb04075.x
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.