Constructing two-weight codes with prescribed groups of automorphisms
Association schemes, strongly regular graphs (05E30) Linear Diophantine equations (11D04) Applications to coding theory and cryptography of arithmetic geometry (14G50) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)
In this paper, new linear two-weight codes are constructed. To obtain these results the authors solve the equivalent problem of finding point sets in the projective geometry with given intersection properties. These point sets are constructed as a solution of a Diophantine system of linear equations. The authors apply a method to shrink this system by prescribing a group of automorphisms. The obtained results about two-weight codes are used to define strongly regular graphs. The authors give tables of the two-weight codes and their corresponding strongly regular graphs.
- A new two-weight code and strongly regular graph
- Applied finite group actions.
- Construction of \((n, r)\)-arcs in \(PG(2, q)\)
- Construction of Linear Codes With Large Minimum Distance
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- scientific article; zbMATH DE number 3988099 (Why is no real title available?)
- scientific article; zbMATH DE number 1229681 (Why is no real title available?)
- scientific article; zbMATH DE number 1057743 (Why is no real title available?)
- Optimal Linear Codes From Matrix Groups
- Projective two-weight codes with small parameters and their corresponding graphs
- Sets of type \((m,n)\) in the affine and projective planes of order nine
- Some new cyclotomic strongly regular graphs
- Some new results for ternary linear codes of dimension 5 and 6
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- t-designs on hypergraphs
- The Geometry of Two-Weight Codes
- Two new optimal ternary two-weight codes and strongly regular graphs
- Two-weight codes, partial geometries and Steiner systems
- Weights of linear codes and strongly regular normed spaces
- The geometry of some two-character sets
- Integral point sets over \(\mathbb Z_n^m\)
- Constructing covering codes with given automorphisms
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- Search for combinatorial objects using lattice algorithms -- revisited
- Some new two-weight codes and strongly regular graphs
- Non-existence of two types of partial difference sets
- Implementing Brouwer's database of strongly regular graphs
- On strongly walk regular graphs, triple sum sets and their codes
- An enumeration of certain projective ternary two-weight codes
- Automorphisms of strongly regular graphs with applications to partial difference sets
- The Geometry of Two-Weight Codes
- Properties of codes with two homogeneous weights
- scientific article; zbMATH DE number 1182720 (Why is no real title available?)
- On linear codes admitting large automorphism groups
- Two-weight codes, partial geometries and Steiner systems
- On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
- Some two-weight codes invariant under the \(3\)-fold covers of the Mathieu groups \(\mathrm{M}_{22}\) and \(\Aut(\mathrm{M}_{22})\)
- Projective two-weight sets of Denniston type
- Cyclotomy over products of finite fields and combinatorial applications
This page was built for publication: Constructing two-weight codes with prescribed groups of automorphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997071)
