Paul H. Siegel

CoRR, 2024

2023

Efficient Constrained Codes That Enable Page Separation in Modern Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Commun., December, 2023

The Noisy Drawing Channel: Reliable Data Storage in DNA Sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, May, 2023

Dimensions of Channel Coding: From Theory to Algorithms to Applications.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Inf. Theory, 2023

A New Version of q-ary Varshamov-Tenengolts Codes with More Efficient Encoders: The Differential VT Codes and The Differential Shifted VT Codes.

[BibT_eX]

[DOI]

Tuan Thanh Nguyen

Kui Cai

CoRR, 2023

Exact Asymptotics for Discrete Noiseless Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

Every Bit Counts: A New Version of Non-binary VT Codes with More Efficient Encoder.

[BibT_eX]

[DOI]

Tuan Thanh Nguyen

Kui Cai

Proceedings of the IEEE International Conference on Communications, 2023

Spatio-Temporal Modeling for Flash Memory Channels Using Conditional Generative Nets.

[BibT_eX]

[DOI]

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2023

2022

Symbolic Regression for Data Storage with Side Information.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

Code-Aware Storage Channel Modeling via Machine Learning.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

Rate-Constrained Shaping Codes for Finite-State Channels With Cost.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2022

Read-and-Run Constrained Coding for Modern Flash Devices.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2022

Polar Codes with Local-Global Decoding.

[BibT_eX]

[DOI]

Ziyuan Zhu

Proceedings of the 56th Asilomar Conference on Signals, Systems, and Computers, ACSSC 2022, Pacific Grove, CA, USA, October 31, 2022

2021

Variable-Length Constrained Coding and Kraft Conditions: The Parity-Preserving Case.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

On Bi-Modal Constrained Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

Covering Codes Using Insertions or Deletions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2021

PR-NN: RNN-Based Detection for Coded Partial-Response Channels.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2021

Modeling Flash Memory Channels Using Conditional Generative Nets.

[BibT_eX]

[DOI]

Chih-Hui Ho

CoRR, 2021

Multivariate Analytic Combinatorics for Cost Constrained Channels and Subsequence Enumeration.

[BibT_eX]

[DOI]

CoRR, 2021

On the Capacity of DNA-based Data Storage under Substitution Errors.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Visual Communications and Image Processing, 2021

Improved Hybrid RM-Polar Codes and Decoding on Stable Permuted Factor Graphs.

[BibT_eX]

[DOI]

Zhen Zhai

Karthik Nagarjuna Tunuguntla

Proceedings of the 11th International Symposium on Topics in Coding, 2021

Polar Shaping Codes for Costly Noiseless and Noisy Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

Optimal Placement of Read Thresholds for Coded NAND Flash Memory.

[BibT_eX]

[DOI]

Yishen Yeh

Arman Fazeli

Proceedings of the ICC 2021, 2021

2020

Coding Over Sets for DNA Storage.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Multi-Erasure Locally Recoverable Codes Over Small Fields: A Tensor Product Approach.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Syndrome-Coupled Rate-Compatible Error-Correcting Codes: Theory and Application.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Rate-Constrained Shaping Codes for Structured Sources.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Functional Error Correction for Robust Neural Networks.

[BibT_eX]

[DOI]

Kunping Huang

Anxiao Jiang

IEEE J. Sel. Areas Inf. Theory, 2020

On the Performance of Direct Shaping Codes.

[BibT_eX]

[DOI]

CoRR, 2020

RNN-based Detection for Coded Partial-Response Channels.

[BibT_eX]

[DOI]

Karthik Nagarjuna Tunuguntla

Proceedings of the IEEE Information Theory Workshop, 2020

Polar Coding for Multi-level 3-Receiver Broadcast Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2020

Improve Robustness of Deep Neural Networks by Coding.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2020

Segmented Reverse Concatenation: A New Approach to Constrained ECC.

[BibT_eX]

[DOI]

Ryan Gabrys

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

On Parity-Preserving Variable-Length Constrained Coding.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Coding for Efficient DNA Synthesis.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

Functional Error Correction for Reliable Neural Networks.

[BibT_eX]

[DOI]

Kunping Huang

Anxiao Andrew Jiang

Proceedings of the IEEE International Symposium on Information Theory, 2020

Achieving the Capacity of the DNA Storage Channel.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Acoustics, 2020

Approximated EM Algorithms for Estimation of Unknown Coded Discrete Memoryless Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2020

2019

Generalized Partial Orders for Polar Code Bit-Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Constructions of Partial MDS Codes Over Small Fields.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2019

Covering Codes for Insertions and Deletions.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2019

An Upper Bound on the Capacity of the DNA Storage Channel.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE Information Theory Workshop, 2019

On the Capacity of the Flash Memory Channel with Inter-cell Interference.

[BibT_eX]

[DOI]

Yonglong Li

Guangyue Han

Proceedings of the IEEE International Symposium on Information Theory, 2019

Anchor-Based Correction of Substitutions in Indexed Sets.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

The Capacity of Count-Constrained ICI-Free Systems.

[BibT_eX]

[DOI]

Karthik Nagarjuna Tunuguntla

Proceedings of the IEEE International Symposium on Information Theory, 2019

Slepian-Wolf Polar Coding with Unknown Correlation.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018

Consecutive Switch Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

Enhancing the Expected Lifetime of NAND Flash by Short q-Ary WOM Codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2018

Universal Polar Coding for Asymmetric Channels.

[BibT_eX]

[DOI]

Karthik Nagarjuna

Proceedings of the IEEE Information Theory Workshop, 2018

On Parity-Preserving Constrained Coding.

[BibT_eX]

[DOI]

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

On the Capacity of 2-Dimensional Channels.

[BibT_eX]

[DOI]

Yonglong Li

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

Ladder Codes: A Class of Error-Correcting Codes with Multi-Level Shared Redundancy.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Conference on Communications, 2018

2017

Multihead Multitrack Detection for Next Generation Magnetic Recording, Part II: Complexity Reduction - Algorithms and Performance Analysis.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2017

Multihead Multitrack Detection for Next Generation Magnetic Recording, Part I: Weighted Sum Subtract Joint Detection With ITI Estimation.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2017

Row-by-Row Coding Schemes for Inter-Cell Interference in Flash Memory.

[BibT_eX]

[DOI]

Sarit Buzaglo

IEEE Trans. Commun., 2017

Polar Code Constructions Based on LLR Evolution.

[BibT_eX]

[DOI]

Albert Guillen i Fabregas

Jing Guo

Aman Bhatia

IEEE Commun. Lett., 2017

Multi-Erasure Locally Recoverable Codes Over Small Fields For Flash Memory Array.

[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

Syndrome-coupled rate-compatible error-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Weakly constrained codes via row-by-row coding.

[BibT_eX]

[DOI]

Sarit Buzaglo

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Performance of optimal data shaping 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

Generalized partial orders for polar code bit-channels.

[BibT_eX]

[DOI]

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

Multi-erasure locally recoverable codes over small fields.

[BibT_eX]

[DOI]

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

2016

Constructions and Decoding of Cyclic Codes Over b-Symbol Read Channels.

[BibT_eX]

[DOI]

Jehoshua Bruck

IEEE Trans. Inf. Theory, 2016

On the Capacity of Channels With Timing Synchronization Errors.

[BibT_eX]

[DOI]

Jack Keil Wolf

IEEE Trans. Inf. Theory, 2016

Binary Linear Locally Repairable Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Channel Models for Multi-Level Cell Flash Memories Based on Empirical Error Analysis.

[BibT_eX]

[DOI]

Hironori Uchikawa

IEEE Trans. Commun., 2016

On the Capacity of the Beta-Binomial Channel Model for Multi-Level Cell Flash Memories.

[BibT_eX]

[DOI]

Hironori Uchikawa

IEEE J. Sel. Areas Commun., 2016

Performance of Multilevel Flash Memories With Different Binary Labelings: A Multi-User Perspective.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2016

Guest Editorial Recent Advances in Capacity Approaching Codes.

[BibT_eX]

[DOI]

Erdal Arikan

Daniel J. Costello Jr.

IEEE J. Sel. Areas Commun., 2016

Multihead Multitrack Detection with ITI Estimation in Next Generation Magnetic Recording System.

[BibT_eX]

[DOI]

CoRR, 2016

Multihead Multitrack Detection with Reduced-State Sequence Estimation.

[BibT_eX]

[DOI]

CoRR, 2016

Performance of flash memories with different binary labelings: A multi-user perspective.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2016

Shaping Codes for Structured Data.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE Global Communications Conference, 2016

2015

Adaptive Read Thresholds for NAND Flash.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2015

Cyclic linear binary locally repairable codes.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Polar codes for magnetic recording channels.

[BibT_eX]

[DOI]

Anantha Raman Krishnan

Proceedings of the 2015 IEEE Information Theory Workshop, 2015

Linear locally repairable codes with availability.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Coding schemes for inter-cell interference in flash memory.

[BibT_eX]

[DOI]

Sarit Buzaglo

Proceedings of the IEEE International Symposium on Information Theory, 2015

Error analysis and inter-cell interference mitigation in multi-level cell flash memories.

[BibT_eX]

[DOI]

Hironori Uchikawa

Proceedings of the 2015 IEEE International Conference on Communications, 2015

Multihead multitrack detection in shingled magnetic recording with ITI estimation.

[BibT_eX]

[DOI]

Proceedings of the 2015 IEEE International Conference on Communications, 2015

2014

Rewriting Codes for Flash Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Optimized Cell Programming for Flash Memories With Quantizers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Error Floor Approximation for LDPC Codes in the AWGN Channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2014

Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

Constrained Codes that Mitigate Inter-Cell Interference in Read/Write Cycles for Flash Memories.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

Lattice-Based WOM Codes for Multilevel Flash Memories.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2014

LDPC Code Density Evolution in the Error Floor Region.

[BibT_eX]

[DOI]

CoRR, 2014

Adaptive linear programming decoding of polar codes.

[BibT_eX]

[DOI]

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

Constructions for constant-weight ICI-free codes.

[BibT_eX]

[DOI]

Scott Kayser

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

Enhanced belief propagation decoding of polar codes through concatenation.

[BibT_eX]

[DOI]

Jing Guo

Albert Guillen i Fabregas

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

2013

Time-Space Constrained Codes for Phase-Change Memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Windowed Decoding of Spatially Coupled Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Bounds on the Minimum Distance of Punctured Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

On the Capacity of Channels with Synchronization Errors

[BibT_eX]

[DOI]

Kees A. Schouhamer Immink

CoRR, 2013

Perspectives on Balanced Sequences

[BibT_eX]

[DOI]

Jos H. Weber

Kees A. Schouhamer Immink

Theo G. Swart

CoRR, 2013

Polarity-balanced codes.

[BibT_eX]

[DOI]

Jos H. Weber

Theo G. Swart

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

Efficient iterative LP decoding of LDPC codes with alternating direction method of multipliers.

[BibT_eX]

[DOI]

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

Parallel programming of rank modulation.

[BibT_eX]

[DOI]

Anxiao Andrew Jiang

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

2012

Adaptive Cut Generation Algorithm for Improved Linear Programming Decoding of Binary Linear Codes.

[BibT_eX]

[DOI]

Alessandro Vanelli-Coralli

IEEE Trans. Inf. Theory, 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

Windowed Decoding of Protograph-Based LDPC Convolutional Codes Over Erasure Channels.

[BibT_eX]

[DOI]

Giovanni Emanuele Corazza

IEEE Trans. Inf. Theory, 2012

Joint Stochastic Decoding of LDPC Codes and Partial-Response Channels.

[BibT_eX]

[DOI]

Saeed Sharifi Tehrani

Shie Mannor

Warren J. Gross

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

Multilevel 2-cell t-write codes.

[BibT_eX]

[DOI]

Aman Bhatia

Proceedings of the 2012 IEEE Information Theory Workshop, 2012

Quantized min-sum decoders with low error floor for LDPC codes.

[BibT_eX]

[DOI]

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

Decoding of cyclic codes over symbol-pair read channels.

[BibT_eX]

[DOI]

Jehoshua Bruck

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

WOM with retained messages.

[BibT_eX]

[DOI]

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

Characterization and error-correcting codes for TLC flash memories.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Computing, Networking and Communications, 2012

Towards minimizing read time for NAND flash.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Global Communications Conference, 2012

Numerical issues affecting LDPC error floors.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE Global Communications Conference, 2012

2011

Efficient Implementation of Linear Programming Decoding.

[BibT_eX]

[DOI]

Amin Shokrollahi

IEEE Trans. Inf. Theory, 2011

Graph-Based Decoding in the Presence of ISI.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Periodic-Finite-Type Shift Spaces.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Non-binary WOM-codes for multilevel flash memories.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE Information Theory Workshop, 2011

Adaptive cut generation for improved linear programming decoding of binary linear codes.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 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

Modeling and information rates for synchronization error channels.

[BibT_eX]

[DOI]

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

Efficient Algorithms to Find All Small Error-Prone Substructures in LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2011

Enhancing Binary Images of Non-Binary LDPC Codes.

[BibT_eX]

[DOI]

Aman Bhatia

Proceedings of the Global Communications Conference, 2011

2010

Storage coding for wear leveling in flash memories.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Analysis of Nonlinear Transition Shift and Write Precompensation in Perpendicular Recording Systems.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2010

Write Channel Model for Bit-Patterned Media Recording

[BibT_eX]

[DOI]

CoRR, 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

Data-dependent write channel model for Magnetic Recording.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

On distance properties of quasi-cyclic protograph-based LDPC codes.

[BibT_eX]

[DOI]

Giovanni Emanuele Corazza

Proceedings of the IEEE International Symposium on Information Theory, 2010

Protograph-Based LDPC Convolutional Codes for Correlated Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2010

Multiple-write WOM-codes.

[BibT_eX]

[DOI]

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

2009

Single-exclusion number and the stopping redundancy of MDS codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Error Event Characterization on 2-D ISI Channels.

[BibT_eX]

[DOI]

Ismail Demirkan

IEEE Trans. Inf. Theory, 2009

Characterizing flash memory: anomalies, observations, and applications.

[BibT_eX]

[DOI]

Proceedings of the 42st Annual IEEE/ACM International Symposium on Microarchitecture (MICRO-42 2009), 2009

A nearly optimal construction of flash codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

On unequal error protection of finite-length LDPC codes over BECs: A scaling approach.

[BibT_eX]

[DOI]

Amir H. Djahanshahi

Proceedings of the IEEE International Symposium on Information Theory, 2009

LDPC codes for the cascaded BSC-BAWGN channel.

[BibT_eX]

[DOI]

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

2008

Adaptive Methods for Linear Programming Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Improved Probabilistic Bounds on Stopping Redundancy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Markov Processes Asymptotically Achieve the Capacity of Finite-State Intersymbol Interference Channels.

[BibT_eX]

[DOI]

Jiangxin Chen

IEEE Trans. Inf. Theory, 2008

Optimal Parsing Trees for Run-Length Coding of Biased Data.

[BibT_eX]

[DOI]

Sharon Aviran

IEEE Trans. Inf. Theory, 2008

Joint iterative decoding of LDPC codes for channels with memory and erasure noise.

[BibT_eX]

[DOI]

IEEE J. Sel. Areas Commun., 2008

Gaussian Belief Propagation for Solving Systems of Linear Equations: Theory and Application

[BibT_eX]

[DOI]

CoRR, 2008

Decoding on Graphs: LDPC-Coded MISO Systems and Belief Propagation.

[BibT_eX]

[DOI]

Amir H. Djahanshahi

Proceedings of the WCNC 2008, IEEE Wireless Communications & Networking Conference, March 31 2008, 2008

Gaussian belief propagation solver for systems of linear equations.

[BibT_eX]

[DOI]

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

On ML redundancy of codes.

[BibT_eX]

[DOI]

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

Gaussian belief propagation based multiuser detection.

[BibT_eX]

[DOI]

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

Nonlinear Transition Shift and Write Precompensation in Perpendicular Magnetic Recording.

[BibT_eX]

[DOI]

Proceedings of IEEE International Conference on Communications, 2008

Multidimensional flash codes.

[BibT_eX]

[DOI]

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

2007

Determining and Approaching Achievable Rates of Binary Intersymbol Interference Channels Using Multistage Decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Improved Upper Bounds on Stopping Redundancy.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Approaching V-BLAST Capacity With Adaptive Modulation and LDPC Encoding.

[BibT_eX]

[DOI]

Yan Zhang

IEEE Trans. Commun., 2007

Equalization on Graphs: Linear Programming and Message Passing.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Bounds on Single-Exclusion Numbers and Stopping Redundancy of MDS Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

On the Multiuser Capacity of WDM in a Nonlinear Optical Fiber: Coherent Communication.

[BibT_eX]

[DOI]

G. C. Papen

IEEE Trans. Inf. Theory, 2006

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2006

On the Probability of Undetected Error for Overextended Reed-Solomon Codes.

[BibT_eX]

[DOI]

Patrick Lee

IEEE Trans. Inf. Theory, 2006

On the symmetric information rate of two-dimensional finite-state ISI channels.

[BibT_eX]

[DOI]

Jiangxin Chen

IEEE Trans. Inf. Theory, 2006

On the Probability of Undetected Error for Over-Extended Reed-Solomon Codes.

[BibT_eX]

[DOI]

Patrick Lee

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Adaptive Linear Programming Decoding.

[BibT_eX]

[DOI]

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

On the Stopping Redundancy of MDS Codes.

[BibT_eX]

[DOI]

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

2005

An improvement to the bit stuffing algorithm.

[BibT_eX]

[DOI]

Sharon Aviran

IEEE Trans. Inf. Theory, 2005

Tradeoff between diversity gain and interference suppression in a MIMO MC-CDMA system.

[BibT_eX]

[DOI]

Yan Zhang

IEEE Trans. Commun., 2005

Serial concatenated TCM with an inner accumulate code - part II: density-evolution analysis.

[BibT_eX]

[DOI]

Hugo M. Tullberg

IEEE Trans. Commun., 2005

Serial concatenated TCM with an inner accumulate code-part I: maximum-likelihood analysis.

[BibT_eX]

[DOI]

Hugo M. Tullberg

IEEE Trans. Commun., 2005

Design of multi-input multi-output systems based on low-density Parity-check codes.

[BibT_eX]

[DOI]

Jilei Hou

IEEE Trans. Commun., 2005

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

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2005

Information Theory A modified Viterbi decoding algorithm for high-rate convolutional codes.

[BibT_eX]

[DOI]

Alexandre Graell i Amat

Sergio Benedetto

Eur. Trans. Telecommun., 2005

On achievable rates of multistage decoding on two-dimensional ISi channels.

[BibT_eX]

[DOI]

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

Lower bounds on the capacity of asymmetric two-dimensional (d, ∞)-constraints.

[BibT_eX]

[DOI]

Jiangxin Chen

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

Relaxation bounds on the minimum pseudo-weight of linear block codes.

[BibT_eX]

[DOI]

Panu Chaichanavong

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

Two-dimensional bit-stuffing schemes with multiple transformers.

[BibT_eX]

[DOI]

Sharon Aviran

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

On the asymptotic performance of iterative decoders for product codes.

[BibT_eX]

[DOI]

Moshe Schwartz

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

2004

Sliding-Block Decodable Encoders Between (d, k) Runlength-Limited Constraints of Equal Capacity.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

Improved bit-stuffing bounds on two-dimensional constraints.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

On performance bounds for space-time codes on fading channels.

[BibT_eX]

[DOI]

André P. des Rosiers

IEEE Trans. Commun., 2004

Enhanced decoding by error detection on a channel with correlated 2-dimensional errors.

[BibT_eX]

[DOI]

Pål Ellingsen

Øyvind Ytrehus

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

On near-capacity coding systems for partial-response channels.

[BibT_eX]

[DOI]

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

Analysis of convolutional codes on the erasure channel.

[BibT_eX]

[DOI]

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

A Ramsey theory approach to ghostbusting.

[BibT_eX]

[DOI]

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

Sliding-block decodable encoders between (d, k)-constrained systems of equal capacity.

[BibT_eX]

[DOI]

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

List-decoding of parity-sharing Reed-Solomon codes in magnetic recording systems.

[BibT_eX]

[DOI]

Michael K. Cheng

Proceedings of IEEE International Conference on Communications, 2004

Ghostbusting: Coding for Optical Communications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information Recording, 2004

2003

The serial concatenation of rate-1 codes through uniform random interleavers.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Joint message-passing decoding of ldpc codes and partial-response channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Capacity-approaching bandwidth-efficient coded modulation schemes based on low-density parity-check codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

MLSE receiver for direct-sequence spread-spectrum systems on a multipath fading channel.

[BibT_eX]

[DOI]

Kai Tang

IEEE Trans. Commun., 2003

On the low-rate Shannon limit for binary intersymbol interference channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2003

Equalities among Capacities of (d, k)-Constrained Systems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Space-time code performance bounds on quasistatic fading channels.

[BibT_eX]

[DOI]

André P. des Rosiers

Proceedings of IEEE International Conference on Communications, 2003

Exact probability of erasure and a decoding algorithm for convolutional codes on the binary erasure channel.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2003

Iterative soft-decision Reed-Solomon decoding on partial response channels.

[BibT_eX]

[DOI]

Michael K. Cheng

Proceedings of the Global Telecommunications Conference, 2003

2002

Editorial: The transactions goes monthly.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

Soft-decision Reed-Solomon decoding on partial response channels.

[BibT_eX]

[DOI]

Michael K. Cheng

Jorge Campello

Proceedings of the Global Telecommunications Conference, 2002

2001

Efficient root-finding algorithm with application to list decoding of Algebraic-Geometric codes.

[BibT_eX]

[DOI]

Xin-Wen Wu

IEEE Trans. Inf. Theory, 2001

Efficient coding schemes for the hard-square model.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2001

On codes that avoid specified differences.

[BibT_eX]

[DOI]

Bruce E. Moision

Alon Orlitsky

IEEE Trans. Inf. Theory, 2001

Performance analysis of turbo-equalized partial response channels.

[BibT_eX]

[DOI]

Mats Öberg

IEEE Trans. Commun., 2001

A comparison of long versus short spreading sequences in coded asynchronous DS-CDMA systems.

[BibT_eX]

[DOI]

Kai Tang

IEEE J. Sel. Areas Commun., 2001

Combined MMSE interference suppression and turbo coding for a coherent DS-CDMA system.

[BibT_eX]

[DOI]

Kai Tang

IEEE J. Sel. Areas Commun., 2001

Guest editorial the turbo principle: from theory to practice.

[BibT_eX]

[DOI]

Dariush Divsalar

Evangelos Eleftheriou

Joachim Hagenauer

Douglas N. Rowitch

William H. Tranter

IEEE J. Sel. Areas Commun., 2001

Guest editorial - the turbo principle: from theory to practice II.

[BibT_eX]

[DOI]

Dariush Divsalar

Evangelos Eleftheriou

Joachim Hagenauer

Douglas N. Rowitch

IEEE J. Sel. Areas Commun., 2001

Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channels.

[BibT_eX]

[DOI]

Jilei Hou

IEEE J. Sel. Areas Commun., 2001

Serial concatenated trellis coded modulation with inner rate-1 accumulate code.

[BibT_eX]

[DOI]

Hugo M. Tullberg

Proceedings of the 54th IEEE Vehicular Technology Conference, 2001

Message-passing decoders and their application to storage systems.

[BibT_eX]

[DOI]

Proceedings of the 2001 IEEE Information Theory Workshop, 2001

Design of low-density parity-check codes for bandwidth efficient modulation.

[BibT_eX]

[DOI]

Proceedings of the 2001 IEEE Information Theory Workshop, 2001

Performance bound for parity-check coded partial-response channels.

[BibT_eX]

[DOI]

Mats Öberg

Proceedings of the IEEE International Conference on Communications, 2001

On the achievable information rates of finite state ISI channels.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2001

Multilevel coding with low-density parity-check component codes.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2001

2000

Turbo decoding for partial response channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2000

1999

Constrained coding for binary channels with high intersymbol interference.

[BibT_eX]

[DOI]

Razmik Karabed

Emina Soljanin

IEEE Trans. Inf. Theory, 1999

Error-Event Characterization on Partial-Response Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1999

Turbo decoding for PR4: parallel versus serial concatenation.

[BibT_eX]

[DOI]

Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999

Effect of varying source kurtosis on the multimodulus algorithm.

[BibT_eX]

[DOI]

André P. des Rosiers

Kees A. Schouhamer Immink

Proceedings of the 1999 IEEE International Conference on Communications: Global Convergence Through Communications, 1999

1998

Codes for Digital Recorders.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

On Viterbi detector path metric differences.

[BibT_eX]

[DOI]

Andrei Vityaev

IEEE Trans. Commun., 1998

1996

Conservative arrays: multidimensional modulation codes for holographic recording.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

Complexity and sliding-block decodability.

[BibT_eX]

[DOI]

Jonathan J. Ashley

Razmik Karabed

IEEE Trans. Inf. Theory, 1996

1994

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

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

Lee-metric BCH codes and their application to constrained and partial-response channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1994

1993

Review of 'Finite Fields for Computer Scientists and Engineers' (McEliece, R.J.; 1987).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Correction to 'A note on the Shannon capacity of runlength-limited codes' (Jul 87 601-605).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Area-efficient architectures for the Viterbi algorithm II. Applications.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1993

Area-efficient architectures for the Viterbi algorithm. I. Theory.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 1993

1992

Finite-State Modulation Codes for Data Storage.

[BibT_eX]

[DOI]

Brian H. Marcus

IEEE J. Sel. Areas Commun., 1992

Decoding on a Finite State Transition Diagram While Avoiding a Sub-Diagram.

[BibT_eX]

[DOI]

Proceedings of the Coding And Quantization, 1992

1991

Matched spectral-null codes for partial-response channels.

[BibT_eX]

[DOI]

Razmik Karabed

IEEE Trans. Inf. Theory, 1991

Variable-length state splitting with applications to average runlength-constrained (ARC) codes.

[BibT_eX]

[DOI]

Chris Heegard

Brian H. Marcus

IEEE Trans. Inf. Theory, 1991

Introduction to special issue on coding for storage devices.

[BibT_eX]

A. Robert Calderbank

IEEE Trans. Inf. Theory, 1991

Modulation and coding for information storage.

[BibT_eX]

[DOI]

IEEE Commun. Mag., 1991

Exact bounds for Viterbi detector path metric differences.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Conference on Acoustics, 1991

1990

Design issues of a rate 8/10 matched-spectral-null trellis code chip for partial response channels.

[BibT_eX]

[DOI]

Proceedings of the 1990 IEEE International Conference on Computer Design: VLSI in Computers and Processors, 1990

1989

The power spectrum of run-length-limited codes.

[BibT_eX]

[DOI]

Ayis Gallopoulos

Chris Heegard

IEEE Trans. Commun., 1989

1987

On codes with spectral nulls at rational submultiples of the symbol frequency.

[BibT_eX]

[DOI]

Brian H. Marcus

IEEE Trans. Inf. Theory, 1987

A note on the Shannon capacity of run-length-limited codes.

[BibT_eX]

[DOI]

Jonathan J. Ashley