The DOI matches its Crossref record; 40 of the 40 references it cites were found in a registry or an index.
Designs and their Codes
Abstract
Algebraic coding theory has in recent years been increasingly applied to the study of combinatorial designs. This book gives an account of many of those applications together with a thorough general introduction to both design theory and coding theory - developing the relationship between the two areas. The first half of the book contains background material in design theory, including symmetric designs and designs from affine and projective geometry, and in coding theory, coverage of most of the important classes of linear codes. In particular, the authors provide a new treatment of the Reed-Muller and generalized Reed-Muller codes. The last three chapters treat the applications of coding theory to some important classes of designs, namely finite planes, Hadamard designs and Steiner systems, in particular the Witt systems. The book is aimed at mathematicians working in either coding theory or combinatorics - or related areas of algebra. The book is, however, designed to be used by non-specialists and can be used by those graduate students or computer scientists who may be working in these areas.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
The Theory of Error-Correcting Codes
(1977) · North-Holland Mathematical Library · doi:10.1016/s0924-6509(08)x7030-8 · Cited by 10,760
Bhatia, R., Bredon, G. E., Walter, W. L., Rotman, J. J., Murty, M. R., Gilman, J., Walters, P., Golubitsky, M., Karatzas, I., Cohen, H., et al. (1977) · Cited by 8,252
Error Detecting and Error Correcting Codes
Hamming, R. W. (1950) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1950.tb00463.x · Cited by 5,377
Huppert, B. (1967) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-3-642-64981-3 · Cited by 5,171
Sphere Packings, Lattices and Groups.
Coxeter, H. S. M., Conway, J. H., & Sloane, N. J. A. (1989) · The American Mathematical Monthly · doi:10.2307/2323992 · Cited by 3,377
Mathematical Theory of Communication
(2009) · Encyclopedia of Communication Theory · doi:10.4135/9781412959384.n229 · Cited by 2,492
Introduction to Finite Fields and their Applications
Lidl, R., & Niederreiter, H. (1994) · Cambridge University Press eBooks · doi:10.1017/cbo9781139172769 · Cited by 2,069
Theory and practice of error control codes
Blahut, R. E. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 2,066
The Classical Groups: Their Invariants and Representations
Weyl, H. (1947) · doi:10.1515/9781400883905 · Cited by 1,603
Cited by
Boolean Functions for Cryptography and Error-Correcting Codes
Carlet, C. (2010) · Boolean Models and Methods in Mathematics, Computer Science, and Engineering · doi:10.1017/cbo9780511780448.011 · Cited by 847
Nonbinary Stabilizer Codes Over Finite Fields
Ketkar, A., Klappenecker, A., Kumar, S., & Sarvepalli, P. K. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.883612 · Cited by 623
Combinatorial Constructions of Low-Density Parity-Check Codes for Iterative Decoding
Vasic, B., & Milenkovic, O. (2004) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.828066 · Cited by 263
Extracting all the randomness and reducing the error in Trevisan's extractors
Raz, R., Reingold, O., & Vadhan, S. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301292 · Cited by 171
Metadata
- Authors
- Assmus, E. F., & Key, J. D.
- Venue
- Cambridge University Press eBooks
- Publisher
- Cambridge University Press
- Published
- 1992-08-28
- OpenAlex
- W2146220490
- Cited by
- 569
- References
- 40
- FWCI
- 2.04
- Type
- book
- 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: Designs and their Codes. https://app.cochat.ai/papers/10.1017/cbo9781316529836
- The paper
- Assmus, E. F., & Key, J. D. (1992). Designs and their Codes. Cambridge University Press eBooks. https://doi.org/10.1017/cbo9781316529836
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.