Algorithms for computing the number of codewords of fixed weight in linear codes


Бакоев, Валентин (2005) Algorithms for computing the number of codewords of fixed weight in linear codes Proc. of IV Intern. Workshop on Optimal codes and related topics (June 17-23, 2005), Pamporovo, Bulgaria, pp. 36-41. ISBN: 954-8986-18-3


 We propose some algorithms for efficient computing the number of codewords of weights not exceeding given integer in linear codes over the field $GF(q)$. The algorithms are developed for the case when $q$ is prime. If $q=p^s$, $p$ is prime and $s>1$, the algorithms can solve the considered problem after few changes, which are also discussed.
  Доклад
 Linear code, Codewords generating


Природни науки, математика и информатика
Природни науки, математика и информатика Информатика и компютърни науки

Natural sciences, mathematics and informatics
Natural sciences, mathematics and informatics Informatics and Computer Science

 Издадено
  4024
 Валентин Бакоев

Научният архив поддържа инициативата за отворен достъп OAI 2.0 с начален адрес: http://da.uni-vt.bg/oai2/