Skip to main content
SpringerLink
Log in

Combinatorial Questions: How Can Graph Labelling Help?

  • Conference paper
  • First Online:
Combinatorial Algorithms (IWOCA 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10765))

Included in the following conference series:

  • 622 Accesses

Abstract

We highlight some connections between graph labelling, combinatorial design theory and information theory. We survey results on the construction and enumeration of Skolem labellings and related structures. This includes discussion of two constructions of low density parity check codes from Skolem labellings. We raise several pertinent questions and suggestions for future research directions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

References

  1. Abrham, J.: Exponential lower bounds for the number of Skolem and extremal Langford sequences. Ars Comb. 22, 187–198 (1986)

    MathSciNet  MATH  Google Scholar 

  2. Baca, B., Baskoro, E.T., Miller, M., Ryan, J., Simanjuntak, R., Sugeng, K.A.: Survey of edge antimagic labelings of graphs. J. Indones. Math. Soc. 12, 113–130 (2006)

    MathSciNet  MATH  Google Scholar 

  3. Bennett, G.K., Grannell, M.J., Griggs, T.S.: Exponential lower bounds for the numbers of Skolem-type sequences. Ars Comb. 73, 101–106 (2004)

    MathSciNet  MATH  Google Scholar 

  4. Cavenagh, N.J., Wanless, I.M.: On the number of transversals in Cayley tables of cyclic groups. Discret. Appl. Math. 158(2), 136–146 (2010)

    Article  MathSciNet  Google Scholar 

  5. Colbourn, C.J., Dinitz, J.H. (eds.): Handbook of Combinatorial Designs. CRC Press, Boca Raton (2006)

    Google Scholar 

  6. Donovan, D., Grannell, M.J.: On the number of additive permutations and Skolem-type sequences. Ars Math. Contemp. 14(2), 415–432 (2017)

    Google Scholar 

  7. Donovan, D., Rao, R., Yazıcı, E.S.: High rate LDPC codes from difference covering arrays. arXiv:1701.05686 (2017)

  8. Eberhard, S., Manners, F., Mrazovic, R.: Additive triples of bijections, or the toroidal semiqueens problem. arXiv:1510.05987 (2015)

  9. Gallager, R.G.: Low density parity check codes. IRE Trans. Inf. Theory IT–8, 21–28 (1962)

    Article  MathSciNet  Google Scholar 

  10. Gallager, R.G.: Low Density Parity Check Codes. MIT Press, Cambridge (1963)

    MATH  Google Scholar 

  11. Gallian, J.A.: A dynamic survey of graph labeling. Electron. J. Comb. 16, #DS6 (2013)

    MathSciNet  MATH  Google Scholar 

  12. Grannell, M.J., Griggs, T.S., Whitehead, C.A.: The resolution of the anti-Pasch conjecture. J. Comb. Des. 8, 300–309 (2000)

    Article  MathSciNet  Google Scholar 

  13. Johnson, S.J., Weller, S.R.: Regular low-density parity-check codes from combinatorial designs. In: Proceedings 2001 IEEE Information Theory Workshop, Cairns, Australia, pp. 90–92, 27 September 2001

    Google Scholar 

  14. Kou, Y., Lin, S., Fossorier, M.P.C.: Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inf. Theory 47, 2711–2736 (2001)

    Article  MathSciNet  Google Scholar 

  15. Ling, A.C.H., Colbourn, C.J., Grannell, M.J., Griggs, T.S.: Construction techniques for anti-Pasch Steiner triple systems. J. London Math. Soc. 61(2), 641–657 (2000)

    Article  MathSciNet  Google Scholar 

  16. MacKay, D.J.C., Neal, R.M.: Near Shannon limit performance of low density parity-check codes. Electron. Lett. 33(6), 457–458 (1997)

    Article  Google Scholar 

  17. MacKay, D.J.C.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inf. Theory 45(2), 399–432 (1999)

    Article  MathSciNet  Google Scholar 

  18. Mahadevan, A., Morris, J.M.: On RCD SPC codes as LPDC codes based on arrays and their equivalence to some codes constructed from Euclidean geometries and partial BIBDs. Technical report no.: CSPL TR:2002–1, Communications and Signal Processing Laboratory, Computer Science and Electrical Engineering Department University, of Maryland, USA

    Google Scholar 

  19. Mendelsohn, E., Shalaby, N.: Skolem labelled graphs. Discret. Math. 97(1–3), 301–317 (1991)

    Article  MathSciNet  Google Scholar 

  20. Park, H., Hong, S., No, J.S., Shin, D.J.: Construction of high-rate regular quasi-cyclic LDPC codes based on cyclic difference families. IEEE Trans. Commun. 61(8), 3108–3113 (2013)

    Article  Google Scholar 

  21. Rosenthal, J., Vontobel, P.O.: Construction of LDPC codes using Ramanujan graphs and ideas from Margulis. In: Proceedings of 2001 IEEE International Symposium Information Theory, Washington, DC, p. 4, June 2001

    Google Scholar 

  22. Shokrollahi, A.: LDPC codes: an introduction. In: Feng, K., Niederreiter, H., Xing, C. (eds.) Coding, Cryptography and Combinatorics, pp. 85–110. Birkhäuser, Basel (2004). https://doi.org/10.1007/978-3-0348-7865-4_5

    Chapter  Google Scholar 

  23. Skolem, T.: On certain distributions of integers in pairs with given differences. Math. Scand. 5, 57–68 (1957)

    Article  MathSciNet  Google Scholar 

  24. Sloane, N.J.A.: The on-line encyclopedia of integer sequences. https://oeis.org/

  25. Tanner, R.M., Srkdhara, D., Fuja, T.: A class of group-structured LDPC codes. http://www.cse.ucsc.edu/tanner/pubs.html

  26. Vardi, I.: Computational Recreations in Mathematics. Addison-Wesley, Boston (1991)

    MATH  Google Scholar 

  27. Vasic, B., Milenkovic, O.: Combinatorial constructions of low-density parity-check codes for iterative decoding. IEEE Trans. Inf. Theory 50(6), 1156–1176 (2004)

    Article  MathSciNet  Google Scholar 

  28. Zhang, L., Huang, Q., Lin, S., Abdel-Ghaffar, A., Blake, I.F.: Quasi-cyclic LDPC codes: an algebraic construction, rank analysis, and codes on Latin squares. IEEE Trans. Commun. 58(11), 3126–3139 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Mathematics and Physics, The University of Queensland, Brisbane, 4072, Australia

    Diane Donovan & Thomas A. McCourt

Authors
  1. Diane Donovan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas A. McCourt
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Diane Donovan or Thomas A. McCourt .

Editor information

Editors and Affiliations

  1. University of Newcastle Australia, Callaghan, New South Wales, Australia

    Ljiljana Brankovic

  2. University of Newcastle Australia, Callaghan, New South Wales, Australia

    Joe Ryan

  3. McMaster University, Hamilton, Ontario, Canada

    William F. Smyth

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Donovan, D., McCourt, T.A. (2018). Combinatorial Questions: How Can Graph Labelling Help?. In: Brankovic, L., Ryan, J., Smyth, W. (eds) Combinatorial Algorithms. IWOCA 2017. Lecture Notes in Computer Science(), vol 10765. Springer, Cham. https://doi.org/10.1007/978-3-319-78825-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-78825-8_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-78824-1

  • Online ISBN: 978-3-319-78825-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation