Identifying codes of Cartesian product of two cliques of the same size.
Identifying codes with small radius in some infinite regular graphs.
Il teorema di equivalenza per i codici ciclici
Every unit in the ring of the residual classes mod induces canonically an automorphism of the algebra . Let be a cyclic code, i.e. an ideal. If the numbers and are relatively prime then there exists a well-known characterization of the code . We extend this characterization to the general case.
Improvements on the Juxtaposing Theorem
A new class of binary constant weight codes is presented. We establish new lower bound and exact values on A(n1 +n2; 2(a1 +a2); n2) ≥ min {M1;M2}+1, if A(n1; 2a1; a1 +b1) = M1 and A(n2; 2b2; a2 +b2) = M2, in particular, A(30; 16; 15) = 16 and A(33; 18; 15) = 11.
Information sets as permutation cycles for quadratic residue codes.
Intersections of -ary perfect codes.
Irrationality and codes.
Isosceles sets.