The Structure and Properties of Binary Cyclic Alphabets
From MaRDI portal
Publication:5342273
DOI10.1002/J.1538-7305.1965.TB01664.XzbMATH Open0132.39902OpenAlexW1995229050MaRDI QIDQ5342273FDOQ5342273
Authors: F. J. MacWilliams
Publication date: 1965
Published in: Bell System Technical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/j.1538-7305.1965.tb01664.x
Cited In (10)
- Algebraic theory of block codes detecting independent errors
- Alphabets of Acyclic Invariant Structures
- A characterization of abelian group codes in terms of their parameters
- Factoring of \(x^ n -1\) and orthogonalization over finite fields of characteristic 2
- Binary cyclotomic polynomials: representation via words and algorithms
- Minimal codes in Abelian group algebras
- Title not available (Why is that?)
- Universal Cycles for Weight-Range Binary Strings
- Divisible codes
- Feedback functions for generating cycles over a finite alphabet
This page was built for publication: The Structure and Properties of Binary Cyclic Alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5342273)