Page 1

Displaying 1 – 4 of 4

Showing per page

Maximal circular codes versus maximal codes

Yannick Guesnet (2001)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.

Maximal circular codes versus maximal codes

Yannick Guesnet (2010)

RAIRO - Theoretical Informatics and Applications

We answer to a question of De Luca and Restivo whether there exists a circular code which is maximal as circular code and not as code.

Metric coset schemes revisited

Paul Camion, Bernard Courteau, André Montpetit (1999)

Annales de l'institut Fourier

An Abelian scheme corresponds to a special instance of what is usually named a Schur-ring. After the needed results have been quoted on additive codes in Abelian schemes and their duals, coset configurations, coset schemes, metric schemes and distance regular graphs, partition designs and completely regular codes, we give alternative proofs of some of those results. In this way we obtain a construction of metric Abelian schemes and an algorithm to compute their intersection matrices.

Currently displaying 1 – 4 of 4

Page 1