Skip to main content
SpringerLink
Log in

On the Characterization of Linear Uniquely Decodable Codes

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

A Uniquely Decodable (UD) Code is a code such that any vector of the ambient space has a unique closest codeword. In this paper we begin a study of the structure of UD codes and identify perfect subcodes. In particular we determine all linear UD codes of covering radius ≤ 2.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. F. Assmus, Jr. and H. F. Mattson, Jr., Coding and combinatorics, SIAM Review, Vol. 16,No. 3 (1974).

  2. C. Berge, Graphes, Gauthier-Villars (1983).

  3. A. E. Brouwer and L. M. G. M. Tolhuizen, A sharpening of the Johnson bound for binary linear codes, Designs, Codes and Cryptography, Vol. 3,No. 1 (1993) pp. 95-98.

    Google Scholar 

  4. J. Borges and I. J. Dejter, On perfect dominating sets in hypercubes and their complements, The Journal of Combinatorial Mathematics and Combinatorial Computing, Vol. 20 (1997) pp. 161-173.

    Google Scholar 

  5. G. Cohen, I. Honkala, S. Litsyn and A. Lobstein, Covering Codes, North-Holland Math. Lib., Vol. 54 (1997).

  6. G. Cohen, S. Litsyn. A. Vardy and G. Zémor, Tilings of binary spaces, SIAM J. Discrete Math., Vol. 9 (1996) pp. 393-412.

    Google Scholar 

  7. G. Cohen, J. Rifà, J. Tena, G. Zémor, On the characterization of uniquely decodable codes, Internal Report ENST 98D007, June 1998.

  8. I. J. Dejter and P. M. Weichsel, Twisted perfect dominating subgraphs of hypercubes, Congressus Num., Vol. 94 (1994) pp. 67-78.

    Google Scholar 

  9. P. Delsarte, Weights of linear codes and strongly regular normed spaces, Discrete Math., Vol. 3 (1972) pp. 47-64.

    Google Scholar 

  10. J. H. van Lint, Introduction to Coding Theory, Graduate Texts in Mathematics, Springer-Verlag, NY (1982).

    Google Scholar 

  11. P. R. J. Östergård and W. D. Weakley, Constructing covering codes with given automorphism, preprint (1997).

  12. P. M. Weichsel, Dominating sets of n-cubes, J. Graph Theory, Vol. 18 (1994) pp. 479-488.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ENST, Dept Inf. and Res., Paris, France

    G. Cohen & G. Zémor

  2. Computer Science Department at the Autonomous, University of Barcelona, Spain

    J. Rifà

  3. Algebra and Geometry Department at the, University of Valladolid, Spain

    J. Tena

Authors
  1. G. Cohen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. Rifà
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. Tena
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. G. Zémor
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cohen, G., Rifà, J., Tena, J. et al. On the Characterization of Linear Uniquely Decodable Codes. Designs, Codes and Cryptography 17, 87–96 (1999). https://doi.org/10.1023/A:1008306605740

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1008306605740

Search

Navigation