1 – 62 of 62
- show: 250
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2016
- Searching for binary and nonbinary block and convolutional LDPC codes
- 2014
- Low-complexity fixed-to-fixed joint source-channel coding
- A unified approach to optimization of LDPC codes for various communication scenarious
- Source-Channel Coding with Multiple Classes
- LDPC Convolutional Codes versus QC LDPC Block Codes in Communication Standard Scenarios
- High Order Modulation in Faster-than-Nyquist Signaling Communication Systems
- 2013
- Combinatorial Optimization for Improving QC LDPC codes performance
- Near maximum-likelihood decoding of Generalized LDPC and Woven graph codes
- 2012
- High-Rate QC LDPC Codes of Short and Moderate Length with Good Girth Profile
- A Closed Form Expression for the Exact Bit Error Probability for Viterbi Decoding of Convolutional Codes
- Searching for voltage graph-based LDPC tailbiting codes with large girth
- A Greedy Search for Improved QC LDPC Codes with Good Girth Profile and Degree Distribution
- 2011
- Woven convolutional graph codes with large free distances
- On the exact bit error probability for Viterbi decoding of convolutional codes
- Some Voltage Graph-Based LDPC Tailbiting Codes with Large Girth
- Another look at the exact bit error probability for Viterbi decoding of convolutional codes
- LDPC codes with large girth based on voltage graphs
- Double-Hamming based QC LDPC codes with large minimum distance
- 2010
- On weight enumerators and MacWilliams identity for convolutional codes
- New low-density parity-check codes with large girth based on hypergraphs
- A rate R=5/20 hypergraph-based woven convolutional code with free distance 120
- Woven graph codes: asymptotic performances and examples
- 2009
- Graph-based convolutional and block LDPC codes
- Compression for multimedia
- Searching for high-rate convolutional codes via binary syndrome trellises
- Short quasi-cyclic LDPC codes from convolutional codes
- 2008
- Woven graph codes over hypergraphs
- An improved bound on the list error probability and list distance properties
- Asymptotic performance of woven graph codes
- Soft-output BEAST decoding with application to product Codes
- 2007
- Asymptotically good woven codes with fixed constituent convolutional codes
- A comparison of some trellis- and tree-based SISO algorithms for decoding and equalization
- Trellis complexity of short linear codes
- 2006
- Interative BEAST-decoding of product codes
- On suboptimum component decoding for product codes
- An improved bound on the list error probability and list distance properties
- Trellis complexity for short linear codes
- 2005
- Estimating the list size for BEAST-APP decoding
- BEAST decoding of block codes obtained via convolutional codes
- BEAST decoding - asymptotic complexity
- 2004
- BEAST decoding for block codes
- Low state complexity block codes via convolutional codes
- A BEAST for prowling in trees
- BEAST decoding for block codes
- On APP-decoding using BEAST
- 2003
- Low state complexity block codes via convolutional codes
- 2002
- Tailbiting codes obtained via convolutional codes with large active distance-slopes
- Trellis representations for quasi-cyclic codes
- Convolutional codes with large slopes yield better tailbiting codes
- Tailbiting codes: Bounds and search results
- How to efficiently find the minimum distance of tailbiting codes
- 2001
- Prowling with a BEAST
- 2000
- Searching for tailbiting codes with large minimum distances
- 1997
- Rational rate punctured convolutional codes for soft-decision Viterbi decoding
- 1995
- Fast exponentation in cryptography
- 1994
- On covering radius of convolutional codes
- 1993
- On trellis codes for linear predictive speech compression
- Fast infinite response filtering for speech processing
- Development of discrete models for fading channels
- 1992
- Decoding for multiple-access channels
- 1991
- Weight enumerators of high-rate convolutional codes based on the Hamming code
- 1990
- Generalizad correlation metric for decoding in a multiple access channel