Daniel J. Costello Jr.

According to our database1, Daniel J. Costello Jr. authored at least 203 papers between 1969 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Designing Protograph-Based Quasi-Cyclic Spatially Coupled LDPC Codes With Large Girth.
IEEE Trans. Commun., 2020

A Threshold-Based Min-Sum Algorithm to Lower the Error Floors of Quantized LDPC Decoders.
IEEE Trans. Commun., 2020

Performance Bounds and Estimates for Quantized LDPC Decoders.
IEEE Trans. Commun., 2020

Error Propagation Mitigation in Sliding Window Decoding of Braided Convolutional Codes.
CoRR, 2020

Decoder Error Propagation Mitigation for Spatially Coupled LDPC Codes.
CoRR, 2020

A Novel Design of Spatially Coupled LDPC Codes for Sliding Window Decoding.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Code Design Based on Connecting Spatially Coupled Graph Chains.
IEEE Trans. Inf. Theory, 2019

Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling.
CoRR, 2019

A Modified Min-Sum Algorithm for Quantized LDPC Decoders.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Encoding of Spatially Coupled LDGM Codes for Lossy Source Compression.
IEEE Trans. Commun., 2018

Spatially Coupled Generalized LDPC Codes: Introduction and Overview.
Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

Performance Bounds for Quantized Spatially Coupled LDPC Decoders Based on Absorbing Sets.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Combating Error Propagation in Window Decoding of Braided Convolutional Codes.
Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017
Braided Convolutional Codes With Sliding Window Decoding.
IEEE Trans. Commun., 2017

Continuous Transmission of Spatially Coupled LDPC Code Chains.
IEEE Trans. Commun., 2017

Non-Uniform Window Decoding Schedules for Spatially Coupled LDPC Codes.
IEEE Trans. Commun., 2017

A frotograph-based design of quasi-cyclic spatially coupled LDPC codes.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Lower bounds for quantized LDPC min-sum decoders based on absorbing sets.
Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016
Design of Spatially Coupled LDPC Codes Over GF (q) for Windowed Decoding.
IEEE Trans. Inf. Theory, 2016

Randomly Punctured LDPC Codes.
IEEE J. Sel. Areas Commun., 2016

Guest Editorial Recent Advances in Capacity Approaching Codes.
IEEE J. Sel. Areas Commun., 2016

On the block error rate performance of spatially coupled LDPC codes for streaming applications.
Proceedings of the 2016 IEEE Information Theory Workshop, 2016

Globally coupled LDPC codes.
Proceedings of the 2016 Information Theory and Applications Workshop, 2016

New perspectives on braided convolutional codes.
Proceedings of the 9th International Symposium on Turbo Codes and Iterative Information Processing, 2016

On the windowed encoding complexity of SC-LDGM codes for lossy source compression.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Performance bounds for quantized LDPC decoders based on absorbing sets.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Windowed encoding of spatially coupled LDGM codes for lossy source compression.
Proceedings of the IEEE International Symposium on Information Theory, 2016

LDPC Code Designs, Constructions, and Unification
Cambridge University Press, ISBN: 9781316780152, 2016

2015
Spatially Coupled LDPC Codes Constructed From Protographs.
IEEE Trans. Inf. Theory, 2015

Performance Comparison of LDPC Block and Spatially Coupled Codes Over GF(q).
IEEE Trans. Commun., 2015

Window decoding of Braided Convolutional Codes.
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Asymptotic distance properties of protograph-based spatially coupled LDPC codes over GF(q).
Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Analyzing the finite-length performance of generalized LDPC codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Approximating decoding thresholds of punctured LDPC code ensembles on the AWGN channel.
Proceedings of the IEEE International Symposium on Information Theory, 2015

EXIT chart analysis of block markov superposition transmission of short codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2014
Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs.
IEEE Trans. Inf. Theory, 2014

Joint Design of Channel and Network Coding for Star Networks Connected by Binary Symmetric Channels.
IEEE Trans. Commun., 2014

Improving the Finite-Length Performance of Spatially Coupled LDPC Codes by Connecting Multiple Code Chains.
CoRR, 2014

Spatially coupled sparse codes on graphs: theory and practice.
IEEE Commun. Mag., 2014

Improving the finite-length performance of long SC-LDPC code chains by connecting consecutive chains.
Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

Randomly punctured spatially coupled LDPC codes.
Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

Threshold analysis of non-binary spatially-coupled LDPC codes with windowed decoding.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Absorbing set characterization of array-based spatially coupled LDPC codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Performance comparison of non-binary LDPC block and spatially coupled codes.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013
Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes.
IEEE Trans. Inf. Theory, 2013

Robust Rate-Compatible Punctured LDPC Convolutional Codes.
IEEE Trans. Commun., 2013

On Achieving an Asymptotically Error-Free Fixed-Point of Iterative Decoding for Perfect A Priori Information.
IEEE Trans. Commun., 2013

Joint Design of Channel and Network Coding for Star Networks
CoRR, 2013

A finite length performance analysis of LDPC codes constructed by connecting spatially coupled chains.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Coded cooperation using rate-compatible spatially-coupled codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

On the minimum distance of generalized spatially coupled LDPC codes.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Joint channel/network coding for star networks.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

Non-uniform windowed decoding schedules for spatially coupled codes.
Proceedings of the 2013 IEEE Global Communications Conference, 2013

2012
Analysis and Design of Tuned Turbo Codes.
IEEE Trans. Inf. Theory, 2012

Low Latency Coding: Convolutional Codes vs. LDPC Codes.
IEEE Trans. Commun., 2012

Constructing good QC-LDPC codes by pre-lifting protographs.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Reduced complexity window decoding schedules for coupled LDPC codes.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

New codes on graphs constructed by connecting spatially coupled chains.
Proceedings of the 2012 Information Theory and Applications Workshop, 2012

A puncturing algorithm for rate-compatible LDPC convolutional codes.
Proceedings of the 7th International Symposium on Turbo Codes and Iterative Information Processing, 2012

Asymptotic analysis of spatially coupled MacKay-Neal and Hsu-Anastasopoulos LDPC codes.
Proceedings of the International Symposium on Information Theory and its Applications, 2012

Distance spectrum estimation of LDPC convolutional codes.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Improving spatially coupled LDPC codes by connecting chains.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Connecting spatially coupled LDPC code chains.
Proceedings of IEEE International Conference on Communications, 2012

2011
Deriving Good LDPC Convolutional Codes from LDPC Block Codes.
IEEE Trans. Inf. Theory, 2011

On the optimal block length for joint channel and network coding.
Proceedings of the 2011 IEEE Information Theory Workshop, 2011

AWGN channel analysis of terminated LDPC convolutional codes.
Proceedings of the Information Theory and Applications Workshop, 2011

Partially-regular LDPC codes with linear encoding complexity and improved thresholds.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Exact free distance and trapping set growth rates for LDPC convolutional codes.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Partially Quasi-Cyclic Protograph-Based LDPC Codes.
Proceedings of IEEE International Conference on Communications, 2011

2010
Braided convolutional codes: a new class of turbo-like codes.
IEEE Trans. Inf. Theory, 2010

Distance bounds for periodically time-varying and tail-biting LDPC convolutional codes.
IEEE Trans. Inf. Theory, 2010

Iterative decoding threshold analysis for LDPC convolutional codes.
IEEE Trans. Inf. Theory, 2010

Mobile Relaying: Coverage Extension and Throughput Enhancement.
IEEE Trans. Commun., 2010

Quasi-cyclic asymptotically regular LDPC codes.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Asymptotically regular LDPC codes with linear distance growth and thresholds close to capacity.
Proceedings of the Information Theory and Applications Workshop, 2010

New families of LDPC block codes formed by terminating irregular protograph-based LDPC convolutional codes.
Proceedings of the IEEE International Symposium on Information Theory, 2010

2009
Pseudocodeword performance analysis for LDPC convolutional codes.
IEEE Trans. Inf. Theory, 2009

Double serially concatenated convolutional codes with jointly designed S-type permutors.
IEEE Trans. Inf. Theory, 2009

Error performance analysis of signal superposition coded cooperative diversity.
IEEE Trans. Commun., 2009

Trapping set analysis of protograph-based LDPC convolutional codes.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Trapping set enumerators for repeat multiple accumulate code ensembles.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Network Coded Cooperative Diversity with Multiple Sources.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

2008
Laminated Turbo Codes: A New Class of Block-Convolutional Codes.
IEEE Trans. Inf. Theory, 2008

Implementation aspects of LDPC convolutional codes.
IEEE Trans. Commun., 2008

Contention-Free Interleavers for High-Throughput Turbo Decoding.
IEEE Trans. Commun., 2008

A Low-Cost Serial Decoder Architecture for Low-Density Parity-Check Convolutional Codes.
IEEE Trans. Circuits Syst. I Regul. Pap., 2008

On the error-correcting capability of LDPC codes.
Probl. Inf. Transm., 2008

Coding Theorems for Repeat Multiple Accumulate Codes
CoRR, 2008

Free Distance Bounds for Protograph-Based Regular LDPC Convolutional Codes
CoRR, 2008

Supercode heuristics for tree search decoding.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

An analysis of mobile relaying for coverage extension.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Heuristic survivor selection for reduced complexity BCJR-type algorithms.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Asymptotically good LDPC convolutional codes based on protographs.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Minimum distance bounds for multiple-serially concatenated code ensembles.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

2007
A Network Coding Approach to Cooperative Diversity.
IEEE Trans. Inf. Theory, 2007

Distance Bounds for an Ensemble of LDPC Convolutional Codes.
IEEE Trans. Inf. Theory, 2007

Channel coding: The road to channel capacity.
Proc. IEEE, 2007

Algebraic Superposition of LDGM Codes for Cooperative Diversity.
Proceedings of the IEEE International Symposium on Information Theory, 2007

Sequential Decoding with a Look-Ahead Path Metric.
Proceedings of the IEEE International Symposium on Information Theory, 2007

On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2007

2006
Bandwidth- and power-efficient routing in linear wireless networks.
IEEE Trans. Inf. Theory, 2006

Joint Permutor Analysis and Design for Multiple Turbo Codes.
IEEE Trans. Inf. Theory, 2006

A new cycle-based joint permutor design for multiple turbo codes.
IEEE Trans. Commun., 2006

Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes
CoRR, 2006

On the Design of S-type Permutors for Double Serially Concatenated Convolutional Codes.
Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Iterative Estimation and Decoding for Gaussian Channels with Abruptly Changing Statistics.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Cooperative diversity based on code superposition.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Pseudo-Codewords in LDPC Convolutional Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Serial concatenation with simple block inner codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the achievable extrinsic information of inner decoders in serial concatenation.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the Free Distance of Convolutional Turbo Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the design of high rate multiple turbo codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Decoders for low-density parity-check convolutional codes with large memory.
Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

Construction of Irregular LDPC Convolutional Codes with Fast Encoding.
Proceedings of IEEE International Conference on Communications, 2006

2005
An analysis of the block error probability performance of iterative decoding.
IEEE Trans. Inf. Theory, 2005

Nonsystematic turbo codes.
IEEE Trans. Commun., 2005

On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices.
Probl. Inf. Transm., 2005

Low rate code designs for multilevel signaling.
IEEE Commun. Lett., 2005

Estimation and decoding strategies for channels with abruptly changing statistics.
Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

A new SISO algorithm with application to turbo equalization.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Terminated LDPC convolutional codes with thresholds close to capacity.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Laminated turbo codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Braided convolutional codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
LDPC block and convolutional codes based on circulant matrices.
IEEE Trans. Inf. Theory, 2004

Universal Lossless Coding for Sources With Repeating Statistics.
IEEE Trans. Inf. Theory, 2004

Bandwidth efficient low complexity multiple turbo coded modulation on frequency-selective fading channels.
Proceedings of the 60th IEEE Vehicular Technology Conference, 2004

On the optimum number of hops in linear wireless networks.
Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Design of turbo codes using high rate nonsystematic convolutional encoders.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On the free distance of LDPC convolutional codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Reduced complexity decoding strategies for LDPC convolutional codes.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Contention-free interleavers.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Turbo codes and Shannon's condition for reliable communication.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A simple method of approximating the error floor of turbo codes with S-type permutors.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Analog rotating ring decoder for an LDPC convolutional code.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002
A new construction for low density parity check convolutional codes.
Proceedings of the 2002 IEEE Information Theory Workshop, 2002

2001
On the frame-error rate of concatenated turbo codes.
IEEE Trans. Commun., 2001

On the redundancy of universal lossless coding for general piecewise stationary sources.
Commun. Inf. Syst., 2001

New low-complexity turbo-like codes.
Proceedings of the 2001 IEEE Information Theory Workshop, 2001

Universal Lossless Compression of Piecewise Stationary Slowly Varying Sources.
Proceedings of the Data Compression Conference, 2001

2000
New deterministic interleaver designs for turbo codes.
IEEE Trans. Inf. Theory, 2000

Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources - Part 1: The regular case.
IEEE Trans. Inf. Theory, 2000

Fundamentals of convolutional coding.
IEEE Trans. Inf. Theory, 2000

Turbo codes for image transmission-a joint channel and source decoding approach.
IEEE J. Sel. Areas Commun., 2000

Performance of hybrid ARQ schemes using turbo trellis coded modulation for wireless channels.
Proceedings of the 2000 IEEE Wireless Communications and Networking Conference, 2000

1999
On the weight distribution of terminated convolutional codes.
IEEE Trans. Inf. Theory, 1999

A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels.
IEEE Trans. Inf. Theory, 1999

A pyramidal image coder using generalized rank-ordered prediction filter.
IEEE Trans. Circuits Syst. Video Technol., 1999

A new technique for computing the weight spectrum of turbo-codes.
IEEE Commun. Lett., 1999

A note on asymmetric turbo-codes.
IEEE Commun. Lett., 1999

1998
Applications of Error-Control Coding.
IEEE Trans. Inf. Theory, 1998

On the Tradeoff between Source and Channel Coding Rates for Image Transmission.
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

Joint Decoding of Turbo Codes for Subband Coded Image.
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

1997
Sequential decoding of trellis codes at high spectral efficiencies.
IEEE Trans. Inf. Theory, 1997

Region-Activity-Based Pyramidal Image Coder Using Generalized Rank-Order Prediction Filter.
Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

On the application of turbo codes to the robust transmission of compressed images.
Proceedings of the Proceedings 1997 International Conference on Image Processing, 1997

1996
New rotationally invariant four-dimensional trellis codes.
IEEE Trans. Inf. Theory, 1996

A distance spectrum interpretation of turbo codes.
IEEE Trans. Inf. Theory, 1996

A geometric construction procedure for geometrically uniform trellis codes.
IEEE Trans. Inf. Theory, 1996

Robustly good trellis codes.
IEEE Trans. Commun., 1996

1995
Sequential decoding with trellis shaping.
IEEE Trans. Inf. Theory, 1995

On a technique to calculate the exact performance of a convolutional code.
IEEE Trans. Inf. Theory, 1995

Probabilistic construction of large constraint length trellis codes for sequential decoding.
IEEE Trans. Commun., 1995

Improved decoding of compressed images received over noisy channels.
Proceedings of the Proceedings 1995 International Conference on Image Processing, 1995

Robust transmission of compressed images over noisy Gaussian channels.
Proceedings of the 1995 International Conference on Acoustics, 1995

1994
Erasure-free sequential decoding of trellis codes.
IEEE Trans. Inf. Theory, 1994

Rotationally invariant nonlinear trellis codes for two-dimensional modulation.
IEEE Trans. Inf. Theory, 1994

Construction of trellis codes with a good distance profile.
IEEE Trans. Commun., 1994

1993
Trellis coding with multidimensional QAM signal sets.
IEEE Trans. Inf. Theory, 1993

1992
New multilevel codes over GF(q).
IEEE Trans. Inf. Theory, 1992

A Markovian Method Common to Both Quantization and Decoding Using Convolutional Codes.
Proceedings of the Coding And Quantization, 1992

An Algebraic Approach to COnstruction Convolutional Codes from Quasi-Cyclic Codes.
Proceedings of the Coding And Quantization, 1992

1990
Trellis-coded multidimensional phase modulation.
IEEE Trans. Inf. Theory, 1990

1989
Parity retransmission hybrid ARQ using rate 1/2 convolutional codes on a nonstationary channel.
IEEE Trans. Commun., 1989

High rate concatenated coding systems using multidimensional bandwidth-efficient trellis inner codes.
IEEE Trans. Commun., 1989

High rate concatenated coding systems using bandwidth efficient trellis inner codes.
IEEE Trans. Commun., 1989

Bandwidth efficient coding for fading channels: code construction and performance analysis.
IEEE J. Sel. Areas Commun., 1989

An algorithm for computing the distance spectrum of trellis codes.
IEEE J. Sel. Areas Commun., 1989

1988
A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes.
IEEE Trans. Inf. Theory, 1988

Capacity and cutoff rate calculations for a concatenated coding system.
IEEE Trans. Inf. Theory, 1988

Introduction to special section on coding techniques.
IEEE Trans. Inf. Theory, 1988

Bandwidth efficient coding on channels disturbed by jamming and impulse noise.
Proceedings of the Coding Theory and Applications, 1988

1987
Reliability and Throughput Analysis of a Concatenated Coding Scheme.
IEEE Trans. Commun., 1987

Decoding of DBEC-TBED Reed-Solomon Codes.
IEEE Trans. Computers, 1987

1986
A Lower Bound on the Minimum Euclidean Distance of Trellis Codes.
Proceedings of the Coding Theory and Applications, 2nd International Colloquium, 1986

1984
ARQ Schemes for Data Transmission in Mobile Radio Systems.
IEEE J. Sel. Areas Commun., 1984

1983
Hybrid ARQ error control using sequential decoding.
IEEE Trans. Inf. Theory, 1983

Error control coding - fundamentals and applications.
Prentice Hall computer applications in electrical engineering series, Prentice Hall, ISBN: 978-0-13-283796-5, 1983

1982
A Comparison of Block and Convolutional Codes in ARQ Error Control Schemes.
IEEE Trans. Commun., 1982

1981
Characteristics of the Hedeman H-1, H-2, and H-3 Codes.
IEEE Trans. Commun., 1981

1980
Generalized minimum distance decoding algorithms for Q ary output channels (Corresp.).
IEEE Trans. Inf. Theory, 1980

Error probability and free distance bounds for two-user tree codes on multiple-access channels.
IEEE Trans. Inf. Theory, 1980

Comments on 'Convolutional tree codes for multiple access channels (Corresp.)' by Ohkubo, M.
IEEE Trans. Inf. Theory, 1980

Asymptotically catastrophic convolutional codes.
IEEE Trans. Inf. Theory, 1980

1979
Binary convolutional codes for a multiple-access channel (Corresp.).
IEEE Trans. Inf. Theory, 1979

1978
An analysis of sequential decoding for specific time-invariant convolutional codes.
IEEE Trans. Inf. Theory, 1978

An Algebraic Construction for <i>q</i>-ary Shift Register Sequences.
IEEE Trans. Computers, 1978

1977
Truncation Error Probability in Viterbi Decoding.
IEEE Trans. Commun., 1977

A Multiple Stack Algorithm for Erasurefree Decoding of Convolutional Codes.
IEEE Trans. Commun., 1977

1976
Distance and Computation in Sequential Decoding.
IEEE Trans. Commun., 1976

1974
Free distance bounds for convolutional codes.
IEEE Trans. Inf. Theory, 1974

1973
Polynomial weights and code constructions.
IEEE Trans. Inf. Theory, 1973

1971
Strengthened lower bound on definite decoding minimum distance for periodic convolutional codes (Corresp.).
IEEE Trans. Inf. Theory, 1971

1969
A construction technique for random-error-correcting convolutional codes.
IEEE Trans. Inf. Theory, 1969


  Loading...