LDPC Code Designs Based on root I Matrices
| Data(s) |
2014
|
|---|---|
| Resumo |
LDPC codes can be constructed by tiling permutation matrices that belong to the square root of identity type and similar algebraic structures. We investigate into the properties of such codes. We also present code structures that are amenable for efficient encoding. |
| Formato |
application/pdf |
| Identificador |
http://eprints.iisc.ernet.in/51459/1/inf_the_app_wor%28ITA%29_277_2014.pdf Srinivasa, Shayan G (2014) LDPC Code Designs Based on root I Matrices. In: Information Theory and Applications Workshop (ITA), FEB 09-14, 2014, San Diego, CA, pp. 277-279. |
| Publicador |
IEEE |
| Relação |
http://dx.doi.org/10.1109/ITA.2014.6804247 http://eprints.iisc.ernet.in/51459/ |
| Palavras-Chave | #Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology) |
| Tipo |
Conference Proceedings NonPeerReviewed |
