Resolvable 2-designs for regular low-density parity-check codes

No abstract is available for this paper.

• Publication year

  2003

• Venue

  IEEE Transactions on Communications

• Publication date

  2003-09-15

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/TCOMM.2003.816946
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Codes on finite geometries

  2005influential reference
• Multilevel expander codes

  2005cited by this paper
• Codes for iterative decoding from partial geometries

  2004cited by this paper
• Low-Density Parity-Check Codes

  2004influential reference
• Regular low-density parity-check codes from oval designs

  2003cited by this paper
• Kirkman systems and their application in perpendicular magnetic recording

  2002cited by this paper
• Finite-length analysis of low-density parity-check codes on the binary erasure channel

  2002cited by this paper
• Stopping sets and the girth of Tanner graphs

  2002cited by this paper
• Finite Geometry Low Density Parity-Check Codes: Construction, Structure, and Decoding

  2002cited by this paper
• Low-density parity-check codes for digital subscriber lines

  2002cited by this paper
• Construction of codes based on finite generalized quadrangles for iterative decoding

  2001cited by this paper
• Minimum-distance bounds by graph analysis

  2001cited by this paper
• Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording

  2001cited by this paper
• Factor graphs and the sum-product algorithm

  2001cited by this paper
• Evaluation of Gallager Codes for Short Block Length and High Rate Applications

  2001cited by this paper
• On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit

  2001cited by this paper
• A 220 mW 1 Gb/s 1024-bit rate-1/2 low density parity check code decoder

  2001cited by this paper
• Low-density parity-check codes based on finite geometries: A rediscovery and new results

  2001cited by this paper
• Asymptotically optimal erasure-resilient codes for large disk arrays

  2000cited by this paper
• The Resolution of the Anti-Pasch Conjecture

  2000cited by this paper
• Gallager codes for CDMA applications .I. Generalizations, constructions, and performance bounds

  2000cited by this paper
• Iterative decoding of one-step majority logic deductible codes based on belief propagation

  2000cited by this paper
• Which codes have cycle-free Tanner graphs?

  1998cited by this paper
• Turbo Decoding as an Instance of Pearl's "Belief Propagation" Algorithm

  1998cited by this paper
• Cyclic resolvability of cyclic Steiner 2-designs

  1997cited by this paper
• Good error-correcting codes based on very sparse matrices

  1997cited by this paper
• The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC).

  1997cited by this paper
• Near Shannon Limit Performance of Low Density Parity Check Codes

  1996cited by this paper
• Anti-mitre steiner triple systems

  1994cited by this paper
• Error Control Systems for Digital Communication and Storage

  1994cited by this paper
• Combinatorial Designs: Construction Methods

  1990influential reference
• Graphs, codes, and designs

  1980cited by this paper
• The Theory of Error-Correcting Codes

  1977cited by this paper
• Difference-set cyclic codes

  1966cited by this paper

• LDPC Codes on Balanced Incomplete Block Designs: Construction, Girth, and Cycle Structure Analysis

  2025cites this paper
• The Cyclically Resolvable Steiner Triple Systems of Order 57

  2025cites this paper
• Sorting in construction of resolutions of combinatorial designs

  2024cites this paper
• Edge coloring of graphs with applications in coding theory

  2021cites this paper
• New construction of partial geometries based on group divisible designs and their associated LDPC codes

  2020cites this paper
• Jointly designed quasi-cyclic LDPC-coded cooperation with diversity combining at receiver

  2020cites this paper
• A Deterministic Construction for Jointly Designed Quasicyclic LDPC Coded-Relay Cooperation

  2019cites this paper
• A Construction of High Performance Quasicyclic LDPC Codes: A Combinatoric Design Approach

  2019cites this paper
• Construction of Quasi-Cyclic LDPC Codes Using a Class of Balanced Incomplete Block Designs with Irregular Block Sizes

  2019cites this paper
• Types of spreads and duality of the parallelisms of PG(3, 5) with automorphisms of order 13

  2018cites this paper
• Types of spreads and duality of the parallelisms of PG(3, 5) with automorphisms of order 13

  2018cites this paper
• Discrete Structures and Applications On the resolutions of cyclic Steiner triple systems with small parameters ∗

  2016cites this paper
• Performance Comparison of Binary LDPC Decoders and FPGA Implementation of Encoder

  2016cites this paper
• Weight distribution of the syndrome of linear codes and connections to combinatorial designs

  2016cites this paper
• Structural Design and Analysis of Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes

  2015influential citation
• High-Rate Quantum Low-Density Parity-Check Codes Assisted by Reliable Qubits

  2013cites this paper
• Low-Density Parity-Check Codes from Transversal Designs with Improved Stopping Set Distributions

  2013cites this paper
• New Combinatorial Construction Techniques for Low-Density Parity-Check Codes and Systematic Repeat-Accumulate Codes

  2012cites this paper
• Construction of High-Rate Regular Quasi-Cyclic LDPC Codes Based on Cyclic Difference Families

  2012cites this paper
• A Characterization of Entanglement-Assisted Quantum Low-Density Parity-Check Codes

  2011cites this paper
• (5, k) regular LDPC codes using novel code-construction

  2010cites this paper
• Novel code-construction of high rate (3, k) regular LDPC codes

  2010cites this paper
• Combinatorial Designs for Authentication and Secrecy Codes

  2010cites this paper
• Burst erasure correcting LDPC codes

  2009cites this paper
• Convolutional, Turbo, and Turbo-Like Codes for Digital Multimedia Broadcasting: Theory and Applications

  2009cites this paper
• FPGA implementation of low density parity check codes decoder

  2009cites this paper
• Some Combinatorial Aspects of Constructing Bipartite-Graph Codes

  2009influential citation
• Low density parity check codes on bipartite graphs with Reed-Solomon constituent codes 1

  2009cites this paper
• Introducing Low-Density Parity-Check Codes

  2008cites this paper
• Regular LDPC Codes from Semipartial Geometries

  2008cites this paper
• Combinatorial Interleavers for Systematic Regular Repeat-Accumulate Codes [Transactions Letters]

  2008cites this paper
• Good equidistant codes constructed from certain combinatorial designs

  2008cites this paper
• A Construction of High Rate Quasi-Cyclic Regular LDPC Codes from Cyclic Difference Families with Girth 8

  2007cites this paper
• Inner configurations in combinatorial designs and their linkage to codes and sequences

  2007cites this paper
• Nonexistence of sparse triple systems over abelian groups and involutions

  2007cites this paper
• Which Codes Have 4-Cycle-Free Tanner Graphs?

  2006cites this paper
• ERASURE CORRECTING LDPC CODES FOR CHANNELS WITH PACKET LOSSES

  2006cites this paper
• Which Codes Have$4$-Cycle-Free Tanner Graphs?

  2006cites this paper
• On the Erdos $r$-sparse conjecture and automorphisms: some recent developments(Algebraic combinatorics and the related areas of research)

  2006cites this paper
• A class of quasi-cyclic regular LDPC codes from cyclic difference families with girth 8

  2005cites this paper
• An analysis of the orthogonality structures of convolutional codes for iterative decoding

  2005cites this paper
• Interleaver and Accumulator Design for Systematic Repeat-Accumulate Codes

  2005cites this paper
• LDPC codes from generalized polygons

  2005cites this paper
• Sparse sequence construction of LDPC codes

  2005cites this paper
• Codes for iterative decoding from partial geometries

  2004cites this paper
• Architecture generique de decodeurs de codes LDPC

  2004cites this paper
• A new family of irregular LDPC codes

  2004cites this paper
• Regular low-density parity-check codes from oval designs

  2003cites this paper
• Information theory: regular low-density parity-check codes from oval designs | NOVA. The University of Newcastle's Digital Repository

  2003cites this paper
• High-rate LDPC codes from unital designs

  2003cites this paper