Skip to main navigation
Skip to search
Skip to main content
New Jersey Institute of Technology Home
Help & FAQ
Home
Profiles
Research units
Facilities
Federal Grants
Research output
Press/Media
Search by expertise, name or affiliation
On trapping sets for repeat accumulate accumulate codes
Jörg Kliewer
, Christian Koller
, Alexandre Graell I. Amat
, Daniel J. Costello
Research output
:
Chapter in Book/Report/Conference proceeding
›
Conference contribution
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On trapping sets for repeat accumulate accumulate codes'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Engineering
Blocklength
100%
Parity Check Code
100%
Maximum Likelihood
100%
Finite Length
100%
Closed Form
100%
Decoding Algorithm
100%
Likelihood Decoding
100%
Repetition Code
100%
Ensemble Average
100%
Belief Propagation
100%
Keyphrases
Trapping Sets
100%
Asymptotic Expression
50%
Block Size
25%
Low-density Parity-check Codes
25%
Minimum Distance
25%
Finite Length
25%
Asymptotically Good
25%
Decoding Algorithm
25%
Maximum Likelihood Decoding
25%
Serial Concatenation
25%
Repetition Code
25%
Bit-flipping Decoding
25%
Gallager
25%
Ensemble Average
25%
Trellis Representation
25%
Enumerator
25%
Encoder Structure
25%
Belief Propagation Decoding
25%
Computer Science
Asymptotic Expression
100%
low-density parity-check code
50%
Belief Propagation
50%
maximum-likelihood decoding
50%
Decoding Algorithm
50%
Repetition Code
50%
Ensemble Average
50%
Mathematics
Asymptotics
100%
Closed Form
50%
Maximum Likelihood
50%
Finite Length
50%
Decoding Algorithm
50%
Ensemble Average
50%
Enumerator
50%