Maximal circular codes versus maximal codes
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.
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.
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.
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.