A construction of channel code, joint source-channel code, and universal code for arbitrary stationary memoryless channels using sparse matrices

No abstract is available for this paper.

• Publication year

  2008

• Venue

  International Symposium on Information Theory

• Publication date

  2008-02-22

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/ISIT.2008.4595176
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Low-density graph codes that are optimal for source/channel coding and binning

  2007cited by this paper
• Construction of a Lossy Source Code Using LDPC Matrices

  2007cited by this paper
• Construction of Universal Codes Using LDPC Matrices and Their Error Exponents

  2007cited by this paper
• On the Performance of Lossless Joint Source-Channel Coding Based on Linear Codes

  2006cited by this paper
• On the joint source-channel coding error exponent for discrete memoryless systems

  2006cited by this paper
• Towards practical minimum-entropy universal decoding

  2005cited by this paper
• Capacity-achieving ensembles for the binary erasure channel with bounded complexity

  2004cited by this paper
• On the application of LDPC codes to arbitrary discrete-memoryless channels

  2003cited by this paper
• Universal data compression with LDPC codes

  2003cited by this paper
• Decoding error-correcting codes via linear programming

  2003cited by this paper
• Low-density parity-check matrices for coding of correlated sources

  2003cited by this paper
• Compression of binary memoryless sources using punctured turbo codes

  2002cited by this paper
• Bounds on the maximum likelihood decoding error probability of low density parity check codes

  2000cited by this paper
• Random coding techniques for nonrandom codes

  1999cited by this paper

• Wireless Multi-Channel Physical Layer Authentication Based on Lightweight Machine Learning and Decision Tree

  2025cites this paper
• Nested Linear/Lattice Codes Revisited

  2020cites this paper
• Achieving channel capacities with nested linear/lattice codes : a unified approach

  2018cites this paper
• Yariable-to-fixed length homophonie coding suitable for asymmetric channel coding

  2017cites this paper
• Variable-to-Fixed Length Homophonic Coding with a Modified Shannon-Fano-Elias Code

  2016cites this paper
• How to achieve the capacity of asymmetric channels

  2014cites this paper
• Sequential pattern mining method for analysis of programming learning history based on the learning process

  2014cites this paper
• Efficient Polar and LDPC Coding for Asymmetric Channels and Sources

  2013influential citation
• Construction of Codes for the Wiretap Channel and the Secret Key Agreement From Correlated Source Outputs Based on the Hash Property

  2012cites this paper
• Hash Property and Fixed-Rate

  2010cites this paper
• Construction of wiretap channel codes by using sparse matrices

  2009cites this paper
• Coding theorem for general stationary memoryless channel based on hash property

  2009cites this paper
• Construction of Codes for Wiretap Channel and Secret Key Agreement from Correlated Source Outputs by Using Sparse Matrices

  2009cites this paper
• Hash Property and Coding Theorems for Sparse Matrices and Maximum-Likelihood Coding

  2008cites this paper
• Hash Property and Fixed-Rate Universal Coding Theorems

  2008influential citation