New good rate (m-1)/pm ternary and quaternary quasi-cyclic codes

This publication has 15 references indexed in Scilit:

• Local search in coding theory
  Discrete Mathematics, 1992
• Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes over GF(3) and GF(4)
  IEEE Transactions on Information Theory, 1992
• Nine good rate (m-1)/pm quasi-cyclic codes
  IEEE Transactions on Information Theory, 1992
• Optimal ternary quasi-cyclic codes
  Designs, Codes and Cryptography, 1992
• Some best rate 1/p and rate (p-1)/p systematic quasi-cyclic codes
  IEEE Transactions on Information Theory, 1991
• Necklaces of beads in k colors and k-ary de Bruijn sequences
  Discrete Mathematics, 1978
• Computerised search for linear binary codes
  Electronics Letters, 1976
• A Gilbert-Varshamov bound for quasi-cycle codes of rate 1/2 (Corresp.)
  IEEE Transactions on Information Theory, 1974
• Some new results on binary linear block codes
  Electronics Letters, 1974
• The random coding bound is tight for the average code (Corresp.)
  IEEE Transactions on Information Theory, 1973