Lengths of divisible codes: the missing cases
From MaRDI portal
Publication:6587209
DOI10.1007/s10623-024-01398-7MaRDI QIDQ6587209
Publication date: 13 August 2024
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Linear codes (general theory) (94B05) Bounds on codes (94B65) Linear codes and caps in Galois spaces (51E22) Combinatorial aspects of packing and covering (05B40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classification of the odd sets in \(\mathrm{PG}(4,4)\) and its application to coding theory
- On the stability of sets of even type
- Small sets of even type in finite projective planes of even order
- On linear codes whose weights and length have a common divisor
- Sets of even type in PG(3,4), alias the binary (85,24) projective geometry code
- Divisible codes
- Divisibility of codes meeting the Griesmer bound
- Small sets of even type and codewords
- On subinvariants i. e. semi-invariants to binary quantics of an unlimited order.
- Johnson type bounds for mixed dimension subspace codes
- On (q + t)-arcs of type (0, 2, t) in a desarguesian plane of order q
- On Sets with Only Odd Secants in Geometries over GF(4)
- The Geometry of Two-Weight Codes
- Computer Classification of Linear Codes
- On the Lengths of Divisible Codes
- A Note on Small Weight Codewords of Projective Geometric Codes and on the Smallest Sets of Even Type
- Vector space partitions of GF(2)^8
- Lengths of divisible codes with restricted column multiplicities
This page was built for publication: Lengths of divisible codes: the missing cases
