Permutation decoding for the binary codes from triangular graphs
- 10 September 2003
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 25 (1) , 113-123
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Binary Codes of Strongly Regular GraphsDesigns, Codes and Cryptography, 1999
- Designs and Codes: An updateDesigns, Codes and Cryptography, 1996
- DESIGNS AND THEIR CODESBulletin of the London Mathematical Society, 1993
- On the p-Rank of the Adjacency Matrices of Strongly Regular GraphsJournal of Algebraic Combinatorics, 1992
- Minimal permutation sets for decoding the binary Golay codes (Corresp.)IEEE Transactions on Information Theory, 1982
- On coveringsPacific Journal of Mathematics, 1964
- Permutation Decoding of Systematic CodesBell System Technical Journal, 1964
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932