Skip to main content

Comma-free codes and incidence algebras

  • 388 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 560)

Abstract

A code which does not require a distinct symbol to separate code words is called comma-free. We study comma-free codes with words of length 2 by considering the binary relation the code defines on its alphabet. If the code is a maximal comma-free code we show that the relation it defines is the support relation of an incidence algebra and its complementary relation will also define an incidence algebra.

Keywords

  • Code Word
  • Triangular Matrice
  • Support Relation
  • Complementary Relation
  • Distinct Symbol

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F.H.C. Crick, J.S. Griffith and L.E. Orgel, Codes without commas, Proc. U.S. Nat. Acad. Sci. 43 (1957), 416–421.

    CrossRef  MathSciNet  Google Scholar 

  2. R.L. Davis, Algebras defined by patterns of zeros, J. Combinatorial Theory 9 (1970), 257–260.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. W.L. Eastman, On the construction of comma-free codes, IEEE TRANS. Information Theory vol. IT-11, 1965, 263–267.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. S.W. Golomb, B. Gordon and L.R. Welch, Comma-free codes, Canad. J. Math. 10 (1958), 202–209.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. D.A. Smith, Incidence functions as generalized arithmetic functions I, Duke Math. J. 34 (1967), 617–633.

    CrossRef  MathSciNet  MATH  Google Scholar 

  6. D.A. Smith, Incidence functions as generalized arithmetic functions II, Duke Math. J. 36 (1969), 15–30.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1976 Springer-Verlag

About this paper

Cite this paper

Cummings, L.J. (1976). Comma-free codes and incidence algebras. In: Casse, L.R.A., Wallis, W.D. (eds) Combinatorial Mathematics IV. Lecture Notes in Mathematics, vol 560. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0097363

Download citation

  • DOI: https://doi.org/10.1007/BFb0097363

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08053-4

  • Online ISBN: 978-3-540-37537-1

  • eBook Packages: Springer Book Archive