Self-orthogonal and self-dual codes constructed via combinatorial designs and Diophantine equations
DOI10.1023/B:DESI.0000029222.35938.BFzbMATH Open1054.94018OpenAlexW2077125930MaRDI QIDQ1877352FDOQ1877352
Authors: Stelios D. Georgiou, Christos Koukouvinos 
Publication date: 16 August 2004
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:desi.0000029222.35938.bf
Recommendations
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Linear codes (general theory) (94B05) Combinatorial codes (94B25) Congruences in many variables (11D79)
Cited In (12)
- Combinatorial designs and codes over some prime fields
- Some connections between self-dual codes, combinatorial designs and secret sharing schemes
- Orthogonal designs, self‐dual codes, and the Leech lattice
- Title not available (Why is that?)
- MDS self-dual codes over large prime fields
- Self-orthogonal designs and extremal doubly even codes
- Self-dual codes from orbit matrices and quotient matrices of combinatorial designs
- Classes of self-orthogonal or self-dual codes from orbit matrices of Menon designs
- Construction of self-orthogonal codes from combinatorial designs
- On extremal and near-extremal self-dual ternary codes
- Self-dual Codes over Small Prime Fields from Combinatorial Designs
- Certain diagonal equations and conflict-avoiding codes of prime lengths
This page was built for publication: Self-orthogonal and self-dual codes constructed via combinatorial designs and Diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1877352)
