Constructing two-weight codes with prescribed groups of automorphisms
DOI10.1016/J.DAM.2007.03.006zbMATH Open1116.94016OpenAlexW2153311525MaRDI QIDQ997071FDOQ997071
Authors: Axel Kohnert 
Publication date: 19 July 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.006
Recommendations
Association schemes, strongly regular graphs (05E30) Linear codes (general theory) (94B05) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Linear Diophantine equations (11D04)
Cites Work
- Sets of type \((m,n)\) in the affine and projective planes of order nine
- The Geometry of Two-Weight Codes
- t-designs on hypergraphs
- Weights of linear codes and strongly regular normed spaces
- Projective two-weight codes with small parameters and their corresponding graphs
- Systematic construction of \(q\)-analogs of \(t\)-\((v,k,\lambda)\)-designs
- Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
- Some new results for ternary linear codes of dimension 5 and 6
- Applied finite group actions.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-weight codes, partial geometries and Steiner systems
- Some new cyclotomic strongly regular graphs
- Optimal Linear Codes From Matrix Groups
- Title not available (Why is that?)
- Two new optimal ternary two-weight codes and strongly regular graphs
- Construction of \((n, r)\)-arcs in \(PG(2, q)\)
- A new two-weight code and strongly regular graph
- Construction of Linear Codes With Large Minimum Distance
Cited In (19)
- Search for combinatorial objects using lattice algorithms -- revisited
- Some new two-weight codes and strongly regular graphs
- Title not available (Why is that?)
- Properties of codes with two homogeneous weights
- On strongly walk regular graphs, triple sum sets and their codes
- Automorphisms of strongly regular graphs with applications to partial difference sets
- Some two-weight codes invariant under the \(3\)-fold covers of the Mathieu groups \(\mathrm{M}_{22}\) and \(\Aut(\mathrm{M}_{22})\)
- Non-existence of two types of partial difference sets
- Two-weight codes, partial geometries and Steiner systems
- On the existence of PD-sets: algorithms arising from automorphism groups of codes
- Cyclotomy over products of finite fields and combinatorial applications
- The geometry of some two-character sets
- Integral point sets over \(\mathbb Z_n^m\)
- Constructing covering codes with given automorphisms
- On the non-existence of a projective \((75, 4, 12, 5)\) set in \(\mathrm{PG}(3, 7)\)
- The Geometry of Two-Weight Codes
- Implementing Brouwer's database of strongly regular graphs
- On linear codes admitting large automorphism groups
- An enumeration of certain projective ternary two-weight codes
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)
