35,115 research outputs found

    Diameter Perfect Lee Codes

    Full text link
    Lee codes have been intensively studied for more than 40 years. Interest in these codes has been triggered by the Golomb-Welch conjecture on the existence of the perfect error-correcting Lee codes. In this paper we deal with the existence and enumeration of diameter perfect Lee codes. As main results we determine all qq for which there exists a linear diameter-4 perfect Lee code of word length nn over Zq,Z_{q}, and prove that for each nβ‰₯3n\geq 3 there are uncountable many diameter-4 perfect Lee codes of word length nn over Z.Z. This is in a strict contrast with perfect error-correcting Lee codes of word length nn over Z Z\,\ as there is a unique such code for n=3,n=3, and its is conjectured that this is always the case when 2n+12n+1 is a prime. We produce diameter perfect Lee codes by an algebraic construction that is based on a group homomorphism. This will allow us to design an efficient algorithm for their decoding. We hope that this construction will turn out to be useful far beyond the scope of this paper

    50 Years of the Golomb--Welch Conjecture

    Full text link
    Since 1968, when the Golomb--Welch conjecture was raised, it has become the main motive power behind the progress in the area of the perfect Lee codes. Although there is a vast literature on the topic and it is widely believed to be true, this conjecture is far from being solved. In this paper, we provide a survey of papers on the Golomb--Welch conjecture. Further, new results on Golomb--Welch conjecture dealing with perfect Lee codes of large radii are presented. Algebraic ways of tackling the conjecture in the future are discussed as well. Finally, a brief survey of research inspired by the conjecture is given.Comment: 28 pages, 2 figure

    Distance-regular graphs

    Get PDF
    This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN' [Brouwer, A.E., Cohen, A.M., Neumaier, A., Distance-Regular Graphs, Springer-Verlag, Berlin, 1989] was written.Comment: 156 page
    • …
    corecore