CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

On the error-detecting performance of a class of irreducible binary cyclic codes and their duals

Rossitza Dodunekova (Institutionen för matematisk statistik) ; O. Rabaste ; J. L. V. Paez
Proc. 9th International Workshop on Algebraic and Combinatorial Coding Theory, Kranevo, Bulgarian p. 131-136. (2004)
[Konferensbidrag, refereegranskat]

The irreducible binary cyclic codes of even dimension introduced by Delsarte and Goethals in 1970 constitute a parametric class with three parameters. We determine for these codes whether they are proper for error detection or not, and show the properness of a major part of their dual codes.

Denna post skapades 2007-01-25.
CPL Pubid: 25926


Institutioner (Chalmers)

Institutionen för matematisk statistik (2002-2004)


Annan matematik

Chalmers infrastruktur