Daniel J. jun. Costello

From MaRDI portal
Revision as of 19:12, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Daniel J. jun. Costello to Daniel J. jun. Costello: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1429268

Available identifiers

zbMath Open costello.daniel-j-junMaRDI QIDQ1429268

List of research outcomes





PublicationDate of PublicationType
Channel codes. Classical and modern (to appear)2024-06-03Paper
Spatially Coupled Generalized LDPC Codes: Asymptotic Analysis and Finite Length Scaling2021-07-23Paper
Code Design Based on Connecting Spatially Coupled Graph Chains2020-01-28Paper
Double Serially Concatenated Convolutional Codes With Jointly Designed S-Type Permutors2017-08-08Paper
Pseudocodeword Performance Analysis for LDPC Convolutional Codes2017-08-08Paper
Braided Convolutional Codes: A New Class of Turbo-Like Codes2017-07-27Paper
Deriving Good LDPC Convolutional Codes from LDPC Block Codes2017-07-27Paper
Iterative Decoding Threshold Analysis for LDPC Convolutional Codes2017-07-27Paper
Distance Bounds for Periodically Time-Varying and Tail-Biting LDPC Convolutional Codes2017-07-27Paper
Analysis and Design of Tuned Turbo Codes2017-07-12Paper
Minimum Distance and Trapping Set Analysis of Protograph-Based LDPC Convolutional Codes2017-06-08Paper
Quasi-Cyclic LDPC Codes Based on Pre-Lifted Protographs2017-05-16Paper
Design of Spatially Coupled LDPC Codes Over GF $(q)$ for Windowed Decoding2017-04-28Paper
Spatially Coupled LDPC Codes Constructed From Protographs2017-04-28Paper
LDPC Code Designs, Constructions, and Unification2016-12-05Paper
Low Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes2015-10-27Paper
https://portal.mardi4nfdi.de/entity/Q52483282015-05-07Paper
https://portal.mardi4nfdi.de/entity/Q52483292015-05-07Paper
On the error-correcting capability of LDPC codes2009-10-20Paper
Laminated turbo codes: A new class of block-convolutional codes2009-02-24Paper
An analysis of the block error probability performance of iterative decoding2008-12-21Paper
Universal Lossless Coding for Sources With Repeating Statistics2008-12-21Paper
https://portal.mardi4nfdi.de/entity/Q35476362008-12-21Paper
LDPC Block and Convolutional Codes Based on Circulant Matrices2008-12-21Paper
A network coding approach to cooperative diversity2008-12-21Paper
Distance Bounds for an Ensemble of LDPC Convolutional Codes2008-12-21Paper
On the minimum distance of low-density parity-check codes with parity-check matrices constructed from permutation matrices2005-12-19Paper
On the redundancy of universal lossless coding for general piecewise stationary sources2004-05-18Paper
https://portal.mardi4nfdi.de/entity/Q44608082004-03-29Paper
On the frame-error rate of concatenated turbo codes2003-08-19Paper
New deterministic interleaver designs for turbo codes2003-02-02Paper
https://portal.mardi4nfdi.de/entity/Q45359362002-06-16Paper
Probabilistic construction of large constraint length trellis codes for sequential decoding2002-02-07Paper
Asymptotically optimal low-complexity sequential lossless coding for piecewise-stationary memoryless sources .I. The regular case2001-03-19Paper
A multilevel approach to constructing trellis-matched codes for binary-input partial-response channels2000-09-07Paper
Applications of error-control coding1999-11-21Paper
On the weight distribution of terminated convolutional codes1999-11-21Paper
Sequential decoding of trellis codes at high spectral efficiencies1998-08-10Paper
Robustly good trellis codes1997-06-23Paper
A distance spectrum interpretation of turbo codes1997-06-12Paper
A geometric construction procedure for geometrically uniform trellis codes1996-10-22Paper
New rotationally invariant four-dimensional trellis codes1996-09-15Paper
Progress Towards Achieving Channel Capacity1996-07-04Paper
Sequential decoding with trellis shaping1996-06-04Paper
Erasure-free sequential decoding of trellis codes1995-11-20Paper
Rotationally invariant nonlinear trellis codes for two-dimensional modulation1995-11-09Paper
On a technique to calculate the exact performance of a convolutional code1995-07-12Paper
https://portal.mardi4nfdi.de/entity/Q42834171994-03-10Paper
Trellis coding with multidimensional QAM signal sets1993-09-16Paper
https://portal.mardi4nfdi.de/entity/Q42834221993-01-01Paper
New multilevel codes over GF(q)1992-09-27Paper
Trellis-coded multidimensional phase modulation1990-01-01Paper
An algorithm for computing the distance spectrum of trellis codes1989-01-01Paper
A lower bound on the minimum Euclidean distance of trellis-coded modulation schemes1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37970971988-01-01Paper
Decoding of DBEC-TBED Reed-Solomon Codes1987-01-01Paper
Hybrid ARQ error control using sequential decoding1983-01-01Paper
Generalized minimum distance decoding algorithms for Qary output channels (Corresp.)1980-01-01Paper
Asymptotically catastrophic convolutional codes1980-01-01Paper
Error probability and free distance bounds for two-user tree codes on multiple-access channels1980-01-01Paper
Binary convolutional codes for a multiple-access channel (Corresp.)1979-01-01Paper
An analysis of sequential decoding for specific time-invariant convolutional codes1978-01-01Paper
An algebraic construction for q-ary shift register sequences1978-01-01Paper
Truncation Error Probability in Viterbi Decoding1977-01-01Paper
A multiple stack algorithm for erasurefree decoding of convolutional codes1977-01-01Paper
Distance and computation in sequential decoding1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40414381974-01-01Paper
Free distance bounds for convolutional codes1974-01-01Paper
Polynomial weights and code constructions1973-01-01Paper
Strengthened lower bound on definite decoding minimum distance for periodic convolutional codes (Corresp.)1971-01-01Paper
A construction technique for random-error-correcting convolutional codes1969-01-01Paper

Research outcomes over time

This page was built for person: Daniel J. jun. Costello