Designs from subcode supports of linear codes
From MaRDI portal
Publication:1008976
DOI10.1007/s10623-007-9145-7zbMath1178.94217OpenAlexW2072170723MaRDI QIDQ1008976
Thomas Britz, Shiromoto, Keisuke
Publication date: 31 March 2009
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-007-9145-7
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On self-dual, doubly even codes of length 32
- The weight distribution of linear codes over \(GF(q^l)\) having generator matrix over \(GF(q)\)
- t-designs from the large Mathieu groups
- The weight enumerator of linear codes over \(\mathrm{GF}(q^m)\) having generator matrix over \(\mathrm{GF}(q)\)
- A new MacWilliams type identity for linear codes
- Designs in additive codes over GF(4)
- A strengthening of the Assmus-Mattson theorem
- The Higher Weight Enumerators of the Doubly-Even, Self-Dual $[48, 24, 12$ Code]
- Designs from Matroids
- On ternary self-dual codes of length 24
- Generalized Hamming weights for linear codes
- Fundamentals of Error-Correcting Codes
- The extended quadratic residue code is the only (48,24,12) self-dual doubly-even code
- The third support weight enumerators of the doubly-even, self-dual [32, 16, 8 codes]
- Geometric approach to higher weights
- New 5-designs
This page was built for publication: Designs from subcode supports of linear codes