Quasicyclic low-density parity check codes

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper introduces a combinatorial construction of regular low-density parity check (LDPC) codes based on balanced incomplete block designs, or more specifically on cyclic difference families of Abelian groups and affine geometries. Several constructions are presented, and the bounds on minimal distance are derived by using the concept of Pasch configurations.

Original languageEnglish (US)
Title of host publication6th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, TELSIKS 2003 - Proceedings
PublisherIEEE Computer Society
Pages417-420
Number of pages4
ISBN (Print)0780379632, 9780780379633
DOIs
StatePublished - Jan 1 2003
Event6th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, TELSIKS 2003 - Nis, Serbia
Duration: Oct 1 2003Oct 3 2003

Publication series

Name6th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, TELSIKS 2003 - Proceedings
Volume2

Other

Other6th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, TELSIKS 2003
CountrySerbia
CityNis
Period10/1/0310/3/03

Keywords

  • Error control
  • Pasch configurations
  • aftine geometries
  • cyclic difference families
  • low-density parity-cheek codes

ASJC Scopus subject areas

  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Quasicyclic low-density parity check codes'. Together they form a unique fingerprint.

  • Cite this

    Vasic, B., & Djordjevic, I. B. (2003). Quasicyclic low-density parity check codes. In 6th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, TELSIKS 2003 - Proceedings (pp. 417-420). [1246258] (6th International Conference on Telecommunications in Modern Satellite, Cable and Broadcasting Service, TELSIKS 2003 - Proceedings; Vol. 2). IEEE Computer Society. https://doi.org/10.1109/TELSKS.2003.1246258