La transitive du groupe d' un code biprefixe fini.
Latin squars, -Quasigroups and graph decompositions
Lattice-Like Total Perfect Codes
A contribution is made to the classification of lattice-like total perfect codes in integer lattices Λn via pairs (G, Φ) formed by abelian groups G and homomorphisms Φ: Zn → G. A conjecture is posed that the cited contribution covers all possible cases. A related conjecture on the unfinished work on open problems on lattice-like perfect dominating sets in Λn with induced components that are parallel paths of length > 1 is posed as well.
Les codes géométriques de Goppa
Linear codes over finite chain rings.
Lower bounds for -ary codes with large covering radius.
Lower bounds for the football pool problem for 7 and 8 matches.