Alexander Vardy

IEEE Trans. Inf. Theory, May, 2024

2023

Tropical Group Testing.

[BibT_eX]

[DOI]

Hsin-Po Wang

Ryan Gabrys

IEEE Trans. Inf. Theory, September, 2023

Sub-4.7 Scaling Exponent of Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, July, 2023

Private Information Retrieval Without Storage Overhead: Coding Instead of Replication.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Efficient Algorithms for the Bee-Identification Problem.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Bee Identification Problem for DNA Strands.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

Transverse-Read-Codes for Domain Wall Memories.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

On the number of distinct <i>k</i>-decks: Enumeration and bounds.

[BibT_eX]

[DOI]

Johan Chrisnata

Sankeerth Rao Karingula

Adv. Math. Commun., 2023

Domination mappings into the hamming ball: Existence, constructions, and algorithms.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2023

2022

Parallelism Versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Wirel. Commun., 2022

Polar Codes for the Deletion Channel: Weak and Strong Polarization.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Endurance-Limited Memories: Capacity and Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Polar Coded Modulation via Hybrid Bit Labeling.

[BibT_eX]

[DOI]

Jinfeng Du

Proceedings of the IEEE International Symposium on Information Theory, 2022

PCR, Tropical Arithmetic, and Group Testing.

[BibT_eX]

[DOI]

Hsin-Po Wang

Ryan Gabrys

Proceedings of the IEEE International Symposium on Information Theory, 2022

Lower bounds on the redundancy of linear codes with disjoint repair groups.

[BibT_eX]

[DOI]

Sankeerth Rao Karingula

Mary Wootters

Proceedings of the IEEE International Symposium on Information Theory, 2022

2021

Polar Coding for Channels With Deletions.

[BibT_eX]

[DOI]

Kuangda Tian

IEEE Trans. Inf. Theory, 2021

Binary Linear Codes With Optimal Scaling: Polar Codes With Large Kernels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Improved Schemes for Asymptotically Optimal Repair of MDS Codes.

[BibT_eX]

[DOI]

Ameera Chowdhury

IEEE Trans. Inf. Theory, 2021

Locally-Constrained de Bruijn Codes: Properties, Enumeration, Code Constructions, and Applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

List Decoding of Arıkan's PAC Codes.

[BibT_eX]

[DOI]

Entropy, 2021

Computing Permanents on a Trellis.

[BibT_eX]

[DOI]

CoRR, 2021

Channel Combining for Nonstationary Polarization on Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Efficient Bee Identification.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding?

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Coding for Transverse-Reads in Domain Wall Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Polar List Decoding for Large Polarization Kernels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

2020

Explicit and Efficient WOM Codes of Finite Length.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Low-Power Cooling Codes With Efficient Encoding and Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Probabilistic existence of large sets of designs.

[BibT_eX]

[DOI]

Shachar Lovett

Sankeerth Rao

J. Comb. Theory A, 2020

Constrained de Bruijn Codes: Properties, Enumeration, Constructions, and Applications.

[BibT_eX]

[DOI]

CoRR, 2020

Polar Codes with Balanced Codewords.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Locally Balanced Constraints.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Hardness of Successive-Cancellation Decoding of Linear Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Algebraic List-Decoding in Projective Space: Decoding With Multiplicities and Rank-Metric Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Endurance-Limited Memories with Informed Decoder.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

Explicit Polar Codes with Small Scaling Exponent.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Convolutional Decoding of Polar Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Number of Distinct k-Decks: Enumeration and Bounds.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

A List-Decoding Approach to Low-Complexity Soft Maximum-Likelihood Decoding of Cyclic Codes.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Global Communications Conference, 2019

2018

Coding for Racetrack Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Cooling Codes: Thermal-Management Coding for High-Performance Interconnects.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Reconstruction from Deletions in Racetrack Memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2018

Codes for Endurance-Limited Memories.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2018

Polar Coding for Deletion Channels: Theory and Implementation.

[BibT_eX]

[DOI]

Kuangda Tian

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

New Constructions of MDS Codes with Asymptotically Optimal Repair.

[BibT_eX]

[DOI]

Ameera Chowdhury

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

Codes Correcting Limited-Shift Errors in Racetrack Memories.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Minimum Storage Regenerating Codes for All Parameters.

[BibT_eX]

[DOI]

Sreechakra Goparaju

IEEE Trans. Inf. Theory, 2017

Polar Coding for the Binary Erasure Channel With Deletions.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2017

Binary Linear Codes with Optimal Scaling and Quasi-Linear Complexity.

[BibT_eX]

[DOI]

CoRR, 2017

On Efficient Decoding of Polar Codes with Large Kernels.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Wireless Communications and Networking Conference Workshops, 2017

Codes correcting position errors in racetrack memories.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Asymptotically optimal sticky-insertion-correcting codes with efficient encoding and decoding.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Explicit constructions of finite-length WOM codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Permuted successive cancellation decoding for polar codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

Low-Complexity Hybrid ARQ Scheme for Polar Codes with Higher-Order Modulation.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Global Communications Conference, 2017

Viterbi-Aided Successive-Cancellation Decoding of Polar Codes.

[BibT_eX]

[DOI]

Kuangda Tian

Proceedings of the 2017 IEEE Global Communications Conference, 2017

Polar codes for channels with deletions.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual Allerton Conference on Communication, 2017

2016

Flexible and Low-Complexity Encoding and Decoding of Systematic Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2016

Fast List Decoders for Polar Codes.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2016

Lower Bound on the Redundancy of PIR Codes.

[BibT_eX]

[DOI]

Sankeerth Rao

CoRR, 2016

Constructions of batch codes with near-optimal redundancy.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

2015

List Decoding of Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Binary Polarization Kernels From Code Decompositions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Generalized Sphere Packing Bound.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

Universal Hashing for Information-Theoretic Security.

[BibT_eX]

[DOI]

Himanshu Tyagi

Proc. IEEE, 2015

Unrolled Polar Decoders, Part II: Fast List Decoders.

[BibT_eX]

[DOI]

CoRR, 2015

PIR with Low Storage Overhead: Coding instead of Replication.

[BibT_eX]

[DOI]

CoRR, 2015

Coding for tag collision recovery.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on RFID, 2015

Codes for RAID solutions based upon SSDs.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Explicit capacity achieving codes for defective memories.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Codes for distributed PIR with low storage overhead.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Rewriting Codes for Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Fast Polar Decoders: Algorithm and Implementation.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

Nontrivial t-designs over finite fields exist for all t.

[BibT_eX]

[DOI]

Shachar Lovett

J. Comb. Theory A, 2014

Semantically-Secure Coding Scheme Achieving the Capacity of a Gaussian Wiretap Channel.

[BibT_eX]

[DOI]

Himanshu Tyagi

CoRR, 2014

Increasing the speed of polar list decoders.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE Workshop on Signal Processing Systems, 2014

A new construction for constant weight codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and its Applications, 2014

Explicit capacity-achieving coding scheme for the Gaussian wiretap channel.

[BibT_eX]

[DOI]

Himanshu Tyagi

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Applications.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

Generalized sphere packing bound: Basic principles.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

On the scaling exponent of binary polarization kernels.

[BibT_eX]

[DOI]

Proceedings of the 52nd Annual Allerton Conference on Communication, 2014

2013

How to Construct Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Algebraic List-Decoding of Subspace Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Coding for the Lee and Manhattan Metrics With Weighing Matrices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Permutation Codes.

[BibT_eX]

[DOI]

Michael Tait

Jacques Verstraëte

CoRR, 2013

Channel upgrading for semantically-secure encryption on wiretap channels.

[BibT_eX]

[DOI]

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

A new polar coding scheme for strong security on wiretap channels.

[BibT_eX]

[DOI]

Eren Sasoglu

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Hardware Implementation of Successive-Cancellation Decoders for Polar Codes.

[BibT_eX]

[DOI]

J. Signal Process. Syst., 2012

Multiple Error-Correcting WOM-Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

Codes for Write-Once Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

A Cryptographic Treatment of the Wiretap Channel.

[BibT_eX]

[DOI]

Mihir Bellare

Stefano Tessaro

IACR Cryptol. ePrint Arch., 2012

Constructing polar codes for non-binary alphabets and MACs.

[BibT_eX]

[DOI]

Artyom Sharov

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

List-decoding of subspace codes and rank-metric codes up to Singleton bound.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Semantic Security for the Wiretap Channel.

[BibT_eX]

[DOI]

Mihir Bellare

Stefano Tessaro

Proceedings of the Advances in Cryptology - CRYPTO 2012, 2012

2011

New Bounds on the Capacity of Multidimensional Run-Length Constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

The Re-Encoding Transformation in Algebraic List-Decoding of Reed-Solomon Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Error-Correcting Codes in Projective Space.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Linearity and Complements in Projective Space

[BibT_eX]

[DOI]

Michael Braun

CoRR, 2011

On q-analogs of Steiner systems and covering designs.

[BibT_eX]

[DOI]

Adv. Math. Commun., 2011

Non-binary WOM-codes for multilevel flash memories.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

On codes that correct asymmetric errors with graded magnitude distribution.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Hardware architectures for successive cancellation decoding of polar codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2011

Algebraic list-decoding of subspace codes with multiplicities.

[BibT_eX]

[DOI]

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

Distributed storage with communication costs.

[BibT_eX]

[DOI]

Craig Armstrong

Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010

Storage coding for wear leveling in flash memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Efficient two-write WOM-codes.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

On the parallel programming of flash memory cells.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Dense error-correcting codes in the Lee metric.

[BibT_eX]

[DOI]

Proceedings of the 2010 IEEE Information Theory Workshop, 2010

Algebraic list-decoding on the operator channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Multiple-write WOM-codes.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

A nearly optimal construction of flash codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

Multiplicity assignments for algebraic soft-decoding of Reed-Solomon codes using the method of types.

[BibT_eX]

[DOI]

Hirakendu Das

Proceedings of the IEEE International Symposium on Information Theory, 2009

Optimal interleaving algorithms for generalized concatenated codes.

[BibT_eX]

[DOI]

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

Improved Probabilistic Bounds on Stopping Redundancy.

[BibT_eX]

[DOI]

Junsheng Han

IEEE Trans. Inf. Theory, 2008

Multidimensional flash codes.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

Low-Latency Factorization Architecture for Algebraic Soft-Decision Decoding of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Zhongfeng Wang

IEEE Trans. Very Large Scale Integr. Syst., 2007

Duality between packings and coverings of the Hamming space.

[BibT_eX]

[DOI]

Gérard D. Cohen

Adv. Math. Commun., 2007

A Complexity Reducing Transformation for the Lee-O'Sullivan Interpolation Algorithm.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Direct Root Computation Architecture for Algebraic Soft-Decision Decoding of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2007), 2007

Factorization Architecture by Direct Root Computation for Algebraic Soft-Decision Decoding of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Acoustics, 2007

2006

On the stopping distance and the stopping redundancy of codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Nonlinear dynamics of iterative decoding systems: analysis and applications.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

Coding for the optical channel: the ghost-pulse constraint.

[BibT_eX]

[DOI]

Navin Kashyap

IEEE Trans. Inf. Theory, 2006

Optimal tristance anticodes in certain graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2006

On an Improvement over Rényi's Equivocation Bound

[BibT_eX]

[DOI]

CoRR, 2006

Analog Codes on Graphs

[BibT_eX]

[DOI]

CoRR, 2006

What's New and Exciting in Algebraic and Combinatorial Coding Theory?

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Minimum Distance of Codes and Their Branching Program Complexity.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

On the Performance of Multivariate Interpolation Decoding of Reed-Solomon Codes.

[BibT_eX]

[DOI]

Farzad Parvaresh

Mohammad H. Taghavi

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Efficient fast interpolation architecture for soft-decision decoding of Reed-Solomon codes.

[BibT_eX]

[DOI]

Zhongfeng Wang

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

Reencoder design for soft-decision decoding of an (255, 239) Reed-Solomon code.

[BibT_eX]

[DOI]

Zhongfeng Wang

Proceedings of the International Symposium on Circuits and Systems (ISCAS 2006), 2006

New Bounds on the Capacity of Multi-dimensional RLL-Constrained Systems.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2006

2005

An Application of Ramsey Theory to Coding for the Optical Channel.

[BibT_eX]

[DOI]

Navin Kashyap

SIAM J. Discret. Math., 2005

On the asymptotic performance of iterative decoders for product codes.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

Correcting Errors Beyond the Guruswami-Sudan Radius in Polynomial Time.

[BibT_eX]

[DOI]

Farzad Parvaresh

Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 2005

2004

Asymptotic Improvement of the Gilbert-Varshamov Bound on the Size of Binary Codes.

[BibT_eX]

[DOI]

Tao Jiang

IEEE Trans. Inf. Theory, 2004

Resolving the Existence of Full-Rank Tilings of Binary Hamming Spaces.

[BibT_eX]

[DOI]

Patric R. J. Östergård

SIAM J. Discret. Math., 2004

Maximum-likelihood decoding of Reed-Solomon codes is NP-hard

[BibT_eX]

[DOI]

Venkatesan Guruswami

Electron. Colloquium Comput. Complex., 2004

On the effect of parity-check weights in iterative decoding.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Polynomial matrix-chain interpolation in sudan-type reed-solomon decoders.

[BibT_eX]

[DOI]

Farzad Parvaresh

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A Ramsey theory approach to ghostbusting.

[BibT_eX]

[DOI]

Navin Kashyap

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Divide-and-conquer interpolation for list decoding of reed-solomon codes.

[BibT_eX]

[DOI]

Peter Trifonov

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003

Algebraic soft-decision decoding of Reed-Solomon codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

The structure of tail-biting trellises: minimality and basic principl.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Full-Rank Tilings of $\mathbbF^8_\!2$ Do Not Exist.

[BibT_eX]

[DOI]

Ari Trachtenberg

SIAM J. Discret. Math., 2003

A complexity reducing transformation in algebraic list decoding of Reed-Solomon codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002

Two-dimensional interleaving schemes with repetitions: Constructions and bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Closest point search in lattices.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001

Signal-space characterization of iterative decoding.

[BibT_eX]

[DOI]

Brendan J. Frey

IEEE Trans. Inf. Theory, 2001

A table of upper bounds for binary codes.

[BibT_eX]

[DOI]

Erik Agrell

Kenneth Zeger

IEEE Trans. Inf. Theory, 2001

The turbo decoding algorithm and its phase trajectories.

[BibT_eX]

[DOI]

Dakshi Agrawal

IEEE Trans. Inf. Theory, 2001

2000

Upper bounds for constant-weight codes.

[BibT_eX]

[DOI]

Erik Agrell

Kenneth Zeger

IEEE Trans. Inf. Theory, 2000

Generalized minimum distance decoding in Euclidean space: Performance analysis.

[BibT_eX]

[DOI]

Dakshi Agrawal

IEEE Trans. Inf. Theory, 2000

1999

Universal Bound on the Performance of Lattice Codes.

[BibT_eX]

[DOI]

Vahid Tarokh

Kenneth Zeger

IEEE Trans. Inf. Theory, 1999

Which codes have cycle-free Tanner graphs?

[BibT_eX]

[DOI]

Ari Trachtenberg

IEEE Trans. Inf. Theory, 1999

Minimal tail-biting trellises: The Golay code and more.

[BibT_eX]

[DOI]

A. Robert Calderbank

G. David Forney Jr.

IEEE Trans. Inf. Theory, 1999

Ordered Binary Decision Diagrams and Minimal Trellises.

[BibT_eX]

[DOI]

John D. Lafferty

IEEE Trans. Computers, 1999

The Parametrized Complexity of Some Fundamental Problems in Coding Theory.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

1998

Interleaving Schemes for Multidimensional Cluster Errors.

[BibT_eX]

[DOI]

Mario Blaum

Jehoshua Bruck

IEEE Trans. Inf. Theory, 1998

On Perfect Codes and Tilings: Problems and Solutions.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1998

1997

Joint equalization and coding for intersymbol interference channels.

[BibT_eX]

[DOI]

Daniel M. Yellin

Ofer Amrani

IEEE Trans. Inf. Theory, 1997

The intractability of computing the minimum distance of a code.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Upper bounds on trellis complexity of lattices.

[BibT_eX]

[DOI]

Vahid Tarokh

IEEE Trans. Inf. Theory, 1997

Algorithmic Complexity in Coding Theory and the Minimum Distance Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996

Proof of a conjecture of McEliece regarding the expansion index of the minimal trellis.

[BibT_eX]

[DOI]

Frank R. Kschischang

IEEE Trans. Inf. Theory, 1996

Conservative arrays: multidimensional modulation codes for holographic recording.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Optimal sectionalization of a trellis.

[BibT_eX]

[DOI]

Alec Lafourcade

IEEE Trans. Inf. Theory, 1996

Generalized minimum-distance decoding of Euclidean-space codes and lattices.

[BibT_eX]

[DOI]

G. David Forney Jr.

IEEE Trans. Inf. Theory, 1996

Introduction to the special issue on codes and complexity.

[BibT_eX]

IEEE Trans. Inf. Theory, 1996

MDS array codes with independent parity symbols.

[BibT_eX]

[DOI]

Mario Blaum

Jehoshua Bruck

IEEE Trans. Inf. Theory, 1996

Tilings of Binary Spaces.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1996

1995

Even more efficient bounded-distance decoding of the hexacode, the Golay code, and the Leech lattice.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1995

Lower bounds on trellis complexity of block codes.

[BibT_eX]

[DOI]

Alec Lafourcade

IEEE Trans. Inf. Theory, 1995

Asymptotically good codes have infinite trellis complexity.

[BibT_eX]

[DOI]

Alec Lafourcade

IEEE Trans. Inf. Theory, 1995

Two New Bounds on the Size of Binary Codes with a Minimum Distance of Three.

[BibT_eX]

[DOI]

Yaron Klein

Simon Litsyn

Des. Codes Cryptogr., 1995

1994

Maximum-likelihood soft decision decoding of BCH codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

The Nordstrom-Robinson code: representation over $GF(4)$ and efficient decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

High-order spectral-null codes - Construction and bounds.

[BibT_eX]

[DOI]

Ron M. Roth

IEEE Trans. Inf. Theory, 1994

The uniqueness of the Best code.

[BibT_eX]

[DOI]

Simon Litsyn

IEEE Trans. Inf. Theory, 1994

Perfect binary codes: constructions, properties, and enumeration.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

The Leech lattice and the Golay code: bounded-distance decoding and multilevel constructions.

[BibT_eX]

[DOI]

Henk C. A. van Tilborg

IEEE Trans. Inf. Theory, 1994

1993

Maximum likelihood decoding of the Leech lattice.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Two new upper bounds for codes of distance 3.

[BibT_eX]

[DOI]

Simon Litsyn

Proceedings of the Algebraic Coding, 1993

Bounded-Distance Decoding of the Leech Lattice and the Golay Code.

[BibT_eX]

[DOI]

Ofer Amrani

Proceedings of the Algebraic Coding, 1993

Some Constructions of Perfect Binary Codes.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1991

More efficient soft decoding of the Golay codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

On the problem of finding zero-concurring codewords.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Bit-level soft-decision decoding of Reed-Solomon codes.

[BibT_eX]

[DOI]