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.
![[img]](http://eprints.iisc.ac.in/style/images/fileicons/application_pdf.png) |
PDF
inf_the_app_wor(ITA)_277_2014.pdf - Published Version Restricted to Registered users only Download (183kB) | Request a copy |
Official URL: http://dx.doi.org/10.1109/ITA.2014.6804247
Abstract
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.
| Item Type: | Conference Proceedings |
|---|---|
| Publisher: | IEEE |
| Additional Information: | Copy right for this article belongs to the IEEE, 345 E 47TH ST, NEW YORK, NY 10017 USA |
| Keywords: | LDPC codes; permutation matrices |
| Department/Centre: | Division of Electrical Sciences > Electronic Systems Engineering (Formerly Centre for Electronic Design & Technology) |
| Date Deposited: | 29 Apr 2015 05:41 |
| Last Modified: | 29 Apr 2015 05:41 |
| URI: | http://eprints.iisc.ac.in/id/eprint/51459 |
Actions (login required)
 |
View Item |
