Khaled A. S. Abdel-Ghaffar

IEEE Trans. Inf. Theory, 2020

2019

Reed-Solomon Based Quasi-Cyclic LDPC Codes: Designs, Girth, Cycle Structure, and Reduction of Short Cycles.

[BibT_eX]

[DOI]

Xin Xiao

Bane Vasic

IEEE Trans. Commun., 2019

Sets of binary sequences with small total Hamming distances.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2019

Quasi-Cyclic LDPC Codes for Correcting Multiple Phased Bursts of Erasures.

[BibT_eX]

[DOI]

Xin Xiao

Bane Vasic

Proceedings of the IEEE International Symposium on Information Theory, 2019

Construction of Partial Geometries and LDPC codes based on Reed-Solomon Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

Reed-Solomon-Based Quasi-Cyclic LDPC Codes: Designs, Cycle Structure and Erasure Correction.

[BibT_eX]

[DOI]

Proceedings of the 2018 Information Theory and Applications Workshop, 2018

A Novel Coding Scheme for Encoding and Iterative Soft-Decision Decoding of Binary BCH Codes of Prime Lengths.

[BibT_eX]

[DOI]

Proceedings of the 2018 Information Theory and Applications Workshop, 2018

Improved Trellis-Based Algorithm for Locating and Breaking Cycles in Bipartite Graphs with Applications to LDPC Codes.

[BibT_eX]

[DOI]

Proceedings of the 2018 Information Theory and Applications Workshop, 2018

Girth-Eight Reed-Solomon Based QC-LDPC Codes.

[BibT_eX]

[DOI]

Xin Xiao

Bane Vasic

Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

Collective Encoding and Iterative Soft-Decision Decoding of Cyclic Codes of Prime Lengths in Galois-Fourier Transform Domain.

[BibT_eX]

[DOI]

Proceedings of the 10th IEEE International Symposium on Turbo Codes & Iterative Information Processing, 2018

2017

Interleaved Constrained Codes With Markers Correcting Bursts of Insertions or Deletions.

[BibT_eX]

[DOI]

Dylan Smith

IEEE Commun. Lett., 2017

Integrated code design for a joint source and channel LDPC coding scheme.

[BibT_eX]

[DOI]

Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Reed-Solomon based globally coupled quasi-cyclic LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the 2017 Information Theory and Applications Workshop, 2017

Iterative soft-decision decoding of reed-solomon codes of prime lengths.

[BibT_eX]

[DOI]

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

Reed-solomon based nonbinary globally coupled LDPC codes: Correction of random errors and bursts of erasures.

[BibT_eX]

[DOI]

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

Bounds for cooperative locality using generalized hamming weights.

[BibT_eX]

[DOI]

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

2016

BCH Codes for the Rosenbloom-Tsfasman Metric.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

On the Maximum True Burst-Correcting Capability of Fire Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2016

Fire codes capable of correcting bursts beyond their guaranteed burst-correcting capabilities.

[BibT_eX]

[DOI]

Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Globally coupled LDPC codes.

[BibT_eX]

[DOI]

Daniel J. Costello Jr.

Proceedings of the 2016 Information Theory and Applications Workshop, 2016

Reed-Solomon based nonbinary LDPC codes.

[BibT_eX]

[DOI]

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

LDPC Code Designs, Constructions, and Unification

[BibT_eX]

[DOI]

Daniel J. Costello Jr.

Cambridge University Press, ISBN: 9781316780152, 2016

2015

Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions With Maximum Exponents.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2015

A Matrix-Theoretic Approach to the Construction of Non-Binary Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2015

Binary kernel matrices of maximum exponents of polar codes of dimensions up to sixteen.

[BibT_eX]

[DOI]

Proceedings of the 2015 Information Theory and Applications Workshop, 2015

An unnoticed strong connection between algebraic-based and protograph-based LDPC codes, Part I: Binary case and interpretation.

[BibT_eX]

[DOI]

Proceedings of the 2015 Information Theory and Applications Workshop, 2015

On the maximum true burst correcting capability of primitive Fire codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Binary nonlinear kernels of maximum exponents of polar codes of dimensions up to sixteen.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

Improved message-passing algorithm for counting short cycles in bipartite graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Algebraic Quasi-Cyclic LDPC Codes: Construction, Low Error-Floor, Large Girth and a Reduced-Complexity Decoding Scheme.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2014

Burst or random error correction based on fire and BCH codes.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Decoding of quasi-cyclic LDPC codes with section-wise cyclic structure.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Construction of non-binary LDPC codes: A matrix-theoretic approach.

[BibT_eX]

[DOI]

Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

Optimized markers for balancing runlength-limited sequences in optical recording.

[BibT_eX]

[DOI]

Carl H. Heymann

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

Quasi-cyclic LDPC codes on two arbitrary sets of a finite field.

[BibT_eX]

[DOI]

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

Codes for correcting three or more adjacent deletions or insertions.

[BibT_eX]

[DOI]

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

A merry-go-round decoding scheme for non-binary quasi-cyclic LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE Global Communications Conference, 2014

A reduced-complexity iterative scheme for decoding quasi-cyclic low-density parity-check codes.

[BibT_eX]

[DOI]

Proceedings of the 48th Asilomar Conference on Signals, Systems and Computers, 2014

2013

Insertion/Deletion Detecting Codes and the Boundary Problem.

[BibT_eX]

[DOI]

Filip Paluncic

IEEE Trans. Inf. Theory, 2013

LDPC Codes on Partial Geometries: Construction, Trapping Set Structure, and Puncturing.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Parity-Check Matrices Separating Erasures From Errors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

A Revolving Iterative Algorithm for Decoding Algebraic Cyclic and Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2013

Trapping set structure of LDPC codes on finite geometries.

[BibT_eX]

[DOI]

Proceedings of the 2013 Information Theory and Applications Workshop, 2013

A revolving iterative algorithm for decoding algebraic quasi-cyclic LDPC codes.

[BibT_eX]

[DOI]

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

Correcting combinations of errors and erasures with Euclidean geometry LDPC codes.

[BibT_eX]

[DOI]

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

Separating redundancy of linear MDS codes.

[BibT_eX]

[DOI]

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

2012

A Multiple Insertion/Deletion Correcting Code for Run-Length Limited Sequences.

[BibT_eX]

[DOI]

Filip Paluncic

Willem A. Clarke

IEEE Trans. Inf. Theory, 2012

Cyclic and Quasi-Cyclic LDPC Codes on Constrained Parity-Check Matrices and Their Trapping Sets.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

A Matrix-Theoretic Approach for Analyzing Quasi-Cyclic Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

On Helberg's Generalization of the Levenshtein Code for Multiple Deletion/Insertion Error Correction.

[BibT_eX]

[DOI]

Filip Paluncic

Willem A. Clarke

IEEE Trans. Inf. Theory, 2012

Asymptotic single-trial strategies for GMD decoding with arbitrary error-erasure tradeoff.

[BibT_eX]

[DOI]

Vladimir R. Sidorenko

Christian Senger

Probl. Inf. Transm., 2012

Quasi-cyclic LDPC codes: Construction and rank analysis of their parity-check matrices.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

A transform approach for constructing quasi-cyclic Euclidean geometry LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the 2012 Information Theory and Applications Workshop, 2012

Trapping set structure of finite geometry LDPC codes.

[BibT_eX]

[DOI]

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

2011

Error-Correcting Codes for Flash Coding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Quasi-Cyclic LDPC Codes on Cyclic Subgroups of Finite Fields.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2011

An Iterative Decoding Algorithm with Backtracking to Lower the Error-Floors of LDPC Codes.

[BibT_eX]

[DOI]

Jingyu Kang

IEEE Trans. Commun., 2011

Cyclic and quasi-cyclic LDPC codes: New developments.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

A transform approach for analyzing and constructing quasi-cyclic low-density parity-check codes.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

Trapping sets of structured LDPC codes.

[BibT_eX]

[DOI]

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

A transform approach for computing the ranks of parity-check matrices of quasi-cyclic LDPC codes.

[BibT_eX]

[DOI]

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

2010

Burst decoding of cyclic codes based on circulant parity-check matrices.

[BibT_eX]

[DOI]

Wai H. Fong

Marc P. C. Fossorier

IEEE Trans. Inf. Theory, 2010

Correcting deletions using linear and cyclic codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2010

Quasi-Cyclic LDPC Codes: An Algebraic Construction, Rank Analysis, and Codes on Latin Squares.

[BibT_eX]

[DOI]

Ian F. Blake

IEEE Trans. Commun., 2010

Cyclic and Quasi-Cyclic LDPC Codes on Row and Column Constrained Parity-Check Matrices and Their Trapping Sets

[BibT_eX]

[DOI]

CoRR, 2010

Circulant Arrays on Cyclic Subgroups of Finite Fields: Rank Analysis and Construction of Quasi-Cyclic LDPC Codes

[BibT_eX]

[DOI]

CoRR, 2010

Quasi-cyclic LDPC codes on Latin squares and the ranks of their parity-check matrices.

[BibT_eX]

[DOI]

Ian F. Blake

Proceedings of the Information Theory and Applications Workshop, 2010

Circulant arrays: Rank analysis and construction of quasi-cyclic LDPC codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

An upper bound on the separating redundancy of linear block codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

Flash Coding Scheme Based on Error-Correcting Codes.

[BibT_eX]

[DOI]

Proceedings of the Global Communications Conference, 2010

2009

Moment balancing templates: constructions to add insertion/deletion correction capability to error correcting or constrained codes.

[BibT_eX]

[DOI]

Khmaies Ouahada

IEEE Trans. Inf. Theory, 2009

Construction of non-binary quasi-cyclic LDPC codes by arrays and array dispersions - [transactions papers].

[BibT_eX]

[DOI]

Meina Xu

IEEE Trans. Commun., 2009

A unified approach to the construction of binary and nonbinary quasi-cyclic LDPC codes based on finite fields.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2009

Two reliability-based iterative majority-logic decoding algorithms for LDPC codes.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2009

2008

Results on Parity-Check Matrices With Optimal Stopping And/Or Dead-End Set Enumerators.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2008

Construction of nonbinary cyclic, quasi-cyclic and regular LDPC codes: a finite geometry approach.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2008

Transactions Papers - Constructions of Nonbinary Quasi-Cyclic LDPC Codes: A Finite Field Approach.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2008

Array dispersions of matrices and constructions of quasi-cyclic LDPC codes over non-binary fields.

[BibT_eX]

[DOI]

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

Separating erasures from errors for decoding.

[BibT_eX]

[DOI]

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

2007

Construction of Regular and Irregular LDPC Codes: Geometry Decomposition and Masking.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Construction of Quasi-Cyclic LDPC Codes for AWGN and Binary Erasure Channels: A Finite Field Approach.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Complete Enumeration of Stopping Sets of Full-Rank Parity-Check Matrices of Hamming Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

Moment Balancing Templates: Universal Constructions to Add Insertion/Deletion Correction Capability to Arbitrary Error Correcting or Constrained Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

On Linear and Cyclic Codes for Correcting Deletions.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

The Optimality of Allocation Methods for Bounded Disagreement Search Queries: The Possible and the Impossible.

[BibT_eX]

[DOI]

IEEE Trans. Knowl. Data Eng., 2006

Algebraic Construction of Quasi-Cyclic LDPC Codes for the AWGN and Erasure Channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2006

Algebraic Constructions of Nonbinary Quasi-Cyclic LDPC Codes.

[BibT_eX]

[DOI]

Lingqi Zeng

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

Burst-Correction Decoding of Cyclic LDPC Codes.

[BibT_eX]

[DOI]

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

Stopping Set Enumerators of Full-Rank Parity-Check Matrices of Hamming Codes.

[BibT_eX]

[DOI]

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

Cyclic Codes for Correcting Bursts of Errors or Erasures With Iterative Decoding.

[BibT_eX]

[DOI]

Marc P. C. Fossorier

Proceedings of the Global Telecommunications Conference, 2006. GLOBECOM '06, San Francisco, CA, USA, 27 November, 2006

Construction of Quasi-Cyclic LDPC Codes Based on the Primitive Elements of Finite Fields.

[BibT_eX]

[DOI]

Lan Lan

Proceedings of the 40th Annual Conference on Information Sciences and Systems, 2006

Algebraic Construction of Quasi-cyclic LDPC Codes - Part II: For AWGN and Binary Random and Burst Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2006

Algebraic Constructions of Quasi-cyclic LDPC Codes - Part I: For AWGN and Binary Random Erasure Channels.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2006

2005

Codes on finite geometries.

[BibT_eX]

[DOI]

Heng Tang

Jun Xu

IEEE Trans. Inf. Theory, 2005

Construction of LDPC codes for AWGN and binary erasure channels based on finite fields.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Stopping set analysis for Hamming codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE ITSOC Information Theory Workshop 2005 on Coding and Complexity, 2005

Constructions of quasi-cyclic LDPC codes for the AWGN and binary erasure channels based on finite fields and affine mappings.

[BibT_eX]

[DOI]

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

2004

On Algebraic Construction of Gallager and Circulant Low-Density Parity-Check Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

A simple derivation of the undetected error probabilities of complementary codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

A trellis-based method for removing cycles from bipartite graphs and construction of low density parity check codes.

[BibT_eX]

[DOI]

IEEE Commun. Lett., 2004

2003

Reduced GMD decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2003

Maximum number of edges joining vertices on a cube.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2003

A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols.

[BibT_eX]

[DOI]

Ivana Djurdjevic

Jun Xu

IEEE Commun. Lett., 2003

Graph-theoretic construction of low-density parity-check codes.

[BibT_eX]

[DOI]

Ivana Djurdjevic

IEEE Commun. Lett., 2003

2002

Repeated use of codes for error detection five times is bad.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2002

2001

Reduced GMD decoding of concatenated codes.

[BibT_eX]

[DOI]

Proceedings of the Global Telecommunications Conference, 2001

2000

Guaranteed error correction rate for a simple concatenated coding scheme with single-trial decoding.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

Constructing efficient DC-free runlength-limited block codes for recording channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2000

1998

Systematic Encoding of the Varshamov-Tenengol'ts Codes and the Constantin-Rao Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1998

Difference Set Codes: Codes with Squared Euclidean Distance of Six for Partial Response Channels.

[BibT_eX]

[DOI]

Øyvind Ytrehus

IEEE Trans. Inf. Theory, 1998

Efficient Detection of Discrepancies in Multiple File Copies.

[BibT_eX]

[DOI]

Distributed Comput., 1998

Detecting Substitutions and Transpositions of Characters.

[BibT_eX]

[DOI]

Comput. J., 1998

Cyclic Allocation of Two-Dimensional Data.

[BibT_eX]

[DOI]

Sunil Prabhakar

Divyakant Agrawal

Proceedings of the Fourteenth International Conference on Data Engineering, 1998

Efficient retrieval of multidimensional datasets through parallel I/O.

[BibT_eX]

[DOI]

Sunil Prabhakar

Divyakant Agrawal

Proceedings of the 5th International Conference On High Performance Computing, 1998

1997

Insertion/deletion correction with spectral nulls.

[BibT_eX]

[DOI]

W. C. Ferreira

Willem A. Clarke

Albertus S. J. Helberg

A. J. Han Vinck

IEEE Trans. Inf. Theory, 1997

A lower bound on the undetected error probability and strictly optimal codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1997

Optimal Allocation of Two-Dimensional Data.

[BibT_eX]

[DOI]

Proceedings of the Database Theory, 1997

1996

Constrained block codes for class-IV partial-response channels with maximum-likelihood sequence estimation.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1996

On the number of mutually orthogonal partial latin squares.

[BibT_eX]

Ars Comb., 1996

1995

Analysis of coding schemes for modulation and error control.

[BibT_eX]

[DOI]

Mario Blaum

IEEE Trans. Inf. Theory, 1995

1994

An Optimal Strategy for Comparing File Copies.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1994

Optimal Detection of a Corrupted Page in a Replicated File.

[BibT_eX]

[DOI]

Proceedings of the 14th International Conference on Distributed Computing Systems, 1994

1993

Optimal Disk Allocation for Partial Match Queries.

[BibT_eX]

[DOI]

ACM Trans. Database Syst., 1993

Cascading runlength-limited sequences.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1993

Efficient Detection of Corrupted Pages in a Replicated File (Preliminary Report).

[BibT_eX]

[DOI]

Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992

A universal neural net with guaranteed convergence to zero system error.

[BibT_eX]

[DOI]

Tsu-Shuan Chang

IEEE Trans. Signal Process., 1992

On unit constraint-length convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1992

1991

Bounds and constructions for runlength-limited error-control block codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1991

Multilevel error-control codes for data storage channels.

[BibT_eX]

[DOI]

Martin Hassner

IEEE Trans. Inf. Theory, 1991

1990

On the Optimality of Disk Allocation for Cartesian Product Files.

[BibT_eX]

[DOI]

Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1990

1989

Some convolutional codes whose free distances are maximal.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1989

1988

Finite-state codes.

[BibT_eX]

[DOI]

Fabrizio Pollara

IEEE Trans. Inf. Theory, 1988

Two-dimensional burst identification codes and their use in burst correction.

[BibT_eX]

[DOI]

Henk C. A. van Tilborg

IEEE Trans. Inf. Theory, 1988

On the existence of optimum cyclic burst correcting codes over GF(q).

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 1988

1986

On the existence of optimum cyclic burst-correcting codes.

[BibT_eX]

[DOI]

Andrew M. Odlyzko

Henk C. A. van Tilborg

IEEE Trans. Inf. Theory, 1986

1984

Soft Error Correction for Increased Densities in VLSI Memories.

[BibT_eX]

[DOI]