Construction of LDPC codes for higher burst-error detecting
The coding of LDPC codes is focused on several aspects: high error-correction,low coding complexity and so on.All the construction methods do not give much consideration on hamming-distance and its distribution because of computation complexity.A suboptimal scheme which is with emphasis on hamming-d...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2007-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/74657588/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841537434883457024 |
|---|---|
| author | YAO Chun-guang1 GE Xin2 LIU Ying-nan3 ZHANG Jian2 |
| author_facet | YAO Chun-guang1 GE Xin2 LIU Ying-nan3 ZHANG Jian2 |
| author_sort | YAO Chun-guang1 |
| collection | DOAJ |
| description | The coding of LDPC codes is focused on several aspects: high error-correction,low coding complexity and so on.All the construction methods do not give much consideration on hamming-distance and its distribution because of computation complexity.A suboptimal scheme which is with emphasis on hamming-distance and its distribution was presented.The codes introduced from this scheme can detect all burst-errors within the length of check matrix’s rank and has no loss in performance of random-error-correction. |
| format | Article |
| id | doaj-art-23af39222ef64d958fdd34fef4f8fdb9 |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2007-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-23af39222ef64d958fdd34fef4f8fdb92025-01-14T08:34:18ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2007-01-0111111574657588Construction of LDPC codes for higher burst-error detectingYAO Chun-guang1GE Xin2LIU Ying-nan3ZHANG Jian2The coding of LDPC codes is focused on several aspects: high error-correction,low coding complexity and so on.All the construction methods do not give much consideration on hamming-distance and its distribution because of computation complexity.A suboptimal scheme which is with emphasis on hamming-distance and its distribution was presented.The codes introduced from this scheme can detect all burst-errors within the length of check matrix’s rank and has no loss in performance of random-error-correction.http://www.joconline.com.cn/zh/article/74657588/LDPC codesGilbert limitcolumn-correlationcolumn principle Gaussian elimination |
| spellingShingle | YAO Chun-guang1 GE Xin2 LIU Ying-nan3 ZHANG Jian2 Construction of LDPC codes for higher burst-error detecting Tongxin xuebao LDPC codes Gilbert limit column-correlation column principle Gaussian elimination |
| title | Construction of LDPC codes for higher burst-error detecting |
| title_full | Construction of LDPC codes for higher burst-error detecting |
| title_fullStr | Construction of LDPC codes for higher burst-error detecting |
| title_full_unstemmed | Construction of LDPC codes for higher burst-error detecting |
| title_short | Construction of LDPC codes for higher burst-error detecting |
| title_sort | construction of ldpc codes for higher burst error detecting |
| topic | LDPC codes Gilbert limit column-correlation column principle Gaussian elimination |
| url | http://www.joconline.com.cn/zh/article/74657588/ |
| work_keys_str_mv | AT yaochunguang1 constructionofldpccodesforhigherbursterrordetecting AT gexin2 constructionofldpccodesforhigherbursterrordetecting AT liuyingnan3 constructionofldpccodesforhigherbursterrordetecting AT zhangjian2 constructionofldpccodesforhigherbursterrordetecting |