Projective two-weight codes with small parameters and their corresponding graphs
From MaRDI portal
Publication:851774
DOI10.1007/s10623-006-0019-1zbMath1205.94123OpenAlexW1992506572MaRDI QIDQ851774
Veerle Fack, Wolfgang Willems, Joost Winne, Iliya G. Bouyukliev
Publication date: 22 November 2006
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-006-0019-1
Applications of graph theory (05C90) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
Related Items (19)
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 ⋮ Self-orthogonal codes from the strongly regular graphs on up to 40 vertices ⋮ Construction of one-Lee weight and two-Lee weight codes over \(\mathbb F_p+v\mathbb F_p\) ⋮ On the non-existence of a projective (75, 4, 12, 5) set in PG(3, 7) ⋮ Construction of one-Gray weight codes and two-Gray weight codes over \(\mathbb{Z}_{4} + u \mathbb{Z}_{4}\) ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ Vector space partitions of GF(2)^8 ⋮ On one-Lee weight and two-Lee weight \(\mathbb{Z}_2\mathbb{Z}_4[u\) additive codes and their constructions] ⋮ Optimal \(p\)-ary codes from one-weight and two-weight codes over \(\mathbb{F}_p + v\mathbb{F}_p^* \) ⋮ On binary self-complementary [120, 9, 56 codes having an automorphism of order 3 and associated SDP designs] ⋮ Several classes of linear codes and their weight distributions ⋮ Constructions of several classes of linear codes with a few weights ⋮ A class of two or three weights linear codes and their complete weight enumerators ⋮ Strongly regular graphs with parameters (81, 30, 9, 12) and a new partial geometry ⋮ Constructing two-weight codes with prescribed groups of automorphisms ⋮ Construction of two-Lee weight codes over ⋮ Binary linear codes with few weights from Boolean functions ⋮ Classification of Griesmer codes and dual transform ⋮ Optimal binary codes from one-Lee weight codes and two-Lee weight projective codes over \(\mathbb Z_4\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes and projective multisets
- Construction of strongly regular graphs, two-weight codes and partial geometries by finite fields
- Caps and codes
- A characterization of some \(\{ 3v_ 2+v_ 3,3v_ 1+v_ 2; 3,3\}\)-minihypers and some \([15,4,9; 3\)-codes with \(B_ 2=0\)]
- The uniformly packed binary \([27, 21, 3 \) and \([35, 29, 3 ]\) codes]
- Weights of linear codes and strongly regular normed spaces
- The Geometry of Two-Weight Codes
- Some new results for optimal ternary linear codes
- A characterization of MMD codes
- A Bound for Error-Correcting Codes
This page was built for publication: Projective two-weight codes with small parameters and their corresponding graphs
