The correspondence between projective codes and 2-weight codes
From MaRDI portal
Publication:1358665
DOI10.1023/A:1008294128110zbMath0872.94043OpenAlexW2116072106MaRDI QIDQ1358665
Marijn van Eupen, Andries E. Brouwer
Publication date: 3 July 1997
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008294128110
Related Items
On the nonexistence of ternary linear codes attaining the Griesmer bound, On the extendability of quasidivisible Griesmer arcs, Linear codes over \({\mathbb{F}}_3+u\mathbb{F}_3+u^2\mathbb{F}_3\): MacWilliams identities, optimal ternary codes from one-Lee weight codes and two-Lee weight codes, Construction of new Griesmer codes of dimension 5, New bounds for the minimum length of quaternary linear codes of dimension five, On the geometric constructions of optimal linear codes, Weight functions and generalized Hamming weights of linear codes, Construction of one-Lee weight and two-Lee weight codes over \(\mathbb F_p+v\mathbb F_p\), Geometric extending of divisible codes and construction of new linear codes, On the minimum length of linear codes over \(\mathbb{F}_5\), Unnamed Item, Construction of one-Gray weight codes and two-Gray weight codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\), Classification of \((3 \bmod 5)\) arcs in \(\mathrm{PG}(3,5)\), Optimal \(p\)-ary codes from one-weight and two-weight codes over \(\mathbb{F}_p + v\mathbb{F}_p^* \), On the minimum length of ternary linear codes, Unnamed Item, Codes and caps from orthogonal Grassmannians, Codes from strongly regular \(( \alpha , \beta )\)-reguli, On optimal non-projective ternary linear codes, On the minimum length of linear codes over the field of 9 elements, Construction of two-Lee weight codes over, Divisibility of codes meeting the Griesmer bound, On optimal linear codes of dimension 4, New bounds for \(n_{4}(k,d)\) and classification of some optimal codes over GF(4), Classification of Griesmer codes and dual transform, On the construction of Griesmer codes of dimension 5, Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
