A link between combinatorial designs and three-weight linear codes
Links between different discrete structures (linear codes, combinatorial designs, connected graphs, some cryptographic primitives, etc.) have been a subject of research of many authors. By these links some obtained results about a given structure can be applied into the others. In this paper, the author describes that partial geometric designs can be constructed from 3-weight codes, almost bent functions and ternary weakly regular bent functions. They show that existence of certain partial geometric designs is equivalent to existence of some families of 3-weight codes. Also, the author introduces a family of graphs related to a family of 3-weight codes. Finally, he provide a classification of Cayley graphs obtained from partial geometric difference sets and weakly regular bent functions.
- \(t{1\over 2}\)-designs
- A characterization of bent functions in terms of strongly regular graphs
- A class of three-weight cyclic codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- A construction of binary linear codes from Boolean functions
- A family of partial geometric designs from three-class association schemes
- Association schemes arising from bent functions
- Codes, graphs, and schemes from nonlinear functions
- Cyclotomic Linear Codes of Order 3
- Directed strongly regular graphs from \(1\frac 12\)-designs
- scientific article; zbMATH DE number 53917 (Why is no real title available?)
- scientific article; zbMATH DE number 3539225 (Why is no real title available?)
- scientific article; zbMATH DE number 3565013 (Why is no real title available?)
- scientific article; zbMATH DE number 1196713 (Why is no real title available?)
- scientific article; zbMATH DE number 708811 (Why is no real title available?)
- scientific article; zbMATH DE number 1024089 (Why is no real title available?)
- scientific article; zbMATH DE number 1088929 (Why is no real title available?)
- scientific article; zbMATH DE number 1424197 (Why is no real title available?)
- Linear Codes From Some 2-Designs
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- On plateaued functions and their constructions.
- Optical orthogonal codes: design, analysis and applications
- Partial geometric difference families
- Plateaued functions and one-and-half difference sets
- Relative Difference Families With Variable Block Sizes and Their Related OOCs
- Secret sharing schemes from three classes of linear codes
- Strongly regular graphs associated with ternary bent functions
- Symmetric \(1\frac{1}{2}\)-designs and \(1\frac{1}{2}\)-difference sets
- Three-weight cyclic codes and their weight distributions
- Value Distributions of Exponential Sums From Perfect Nonlinear Functions and Their Applications
- Weights of linear codes and strongly regular normed spaces
- Cyclotomic trace codes
- Weight distributions and weight hierarchies of a family of \(p\)-ary linear codes
- Three-class association schemes from partial geometric designs
- Graphs of vectorial plateaued functions as difference sets
- A family of partial geometric designs from three-class association schemes
- scientific article; zbMATH DE number 5976589 (Why is no real title available?)
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\)
- The extended codes of projective two-weight codes
- Construction of several infinite families of linear codes with new parameters: Hamming weight enumerators and hull dimensions
- Infinite families of linear codes over finite fields with new parameters and their hull dimensions
- Binary t-divisible codes via simplicial complexes and their applications
- Hamming weight enumerators and hulls of linear codes with new parameters associated with simplicial complexes
This page was built for publication: A link between combinatorial designs and three-weight linear codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741922)
