Low density parity check matrices for coding of multiple access networks
The paper considers linear matrices for a coding problem for multiple access networks. It is proved that we can construct codes by using sparse matrices, which are also called low density parity check (LDPC) matrices.
Uloženo v:
| Vydáno v: | 2003 IEEE Information Theory Workshop : proceedings : La Sorbonne, Paris, France, 31 March-4 April, 2003 s. 304 - 307 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina japonština |
| Vydáno: |
IEEE
01.01.2003
|
| Témata: | |
| ISBN: | 0780377990, 9780780377998 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The paper considers linear matrices for a coding problem for multiple access networks. It is proved that we can construct codes by using sparse matrices, which are also called low density parity check (LDPC) matrices. |
|---|---|
| AbstractList | The paper considers linear matrices for a coding problem for multiple access networks. It is proved that we can construct codes by using sparse matrices, which are also called low density parity check (LDPC) matrices. |
| Author | Muramatsu, J. Wadayama, T. Uyematsu, T. |
| Author_xml | – sequence: 1 givenname: J. surname: Muramatsu fullname: Muramatsu, J. organization: NTT Commun. Sci. Labs., NTT Corp., Kyoto, Japan – sequence: 2 givenname: T. surname: Uyematsu fullname: Uyematsu, T. – sequence: 3 givenname: T. surname: Wadayama fullname: Wadayama, T. |
| BookMark | eNotj11LwzAYRgM60H3cC97kD7S-adqmuZShblDwZuLlyMcbjWubklTG_r2T7dyciwMPPHNyO4QBCXlgkDMG8mm7-8wLAJ6zgtWiKm_IHEQDXAgp4Y6sUvqBM1xWrKnuyaYNR2pxSH460VHFf5lvNAfaqyl6g4m6EKkJ1g9fNDja_3aTHzukypxjogNOxxAPaUlmTnUJV1cvyMfry269ydr3t-36uc08Z-WUKW6VE2DKShe2LDVKqbSpBThhK82d0Nphg8wJBbV1DA3jyqoakAmrreEL8njZ9Yi4H6PvVTztr2f5H9XPTmQ |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ITW.2003.1216754 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 307 |
| ExternalDocumentID | 1216754 |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAVQY AAWTH ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK OCL RIE RIL |
| ID | FETCH-LOGICAL-i314t-a3daf70c45b2d44be99abc670f7d5b3f7bbfe8e1f7a06df1ec13ada60e17dbdc3 |
| IEDL.DBID | RIE |
| ISBN | 0780377990 9780780377998 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000184542400075&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Tue Aug 26 16:54:23 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English Japanese |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i314t-a3daf70c45b2d44be99abc670f7d5b3f7bbfe8e1f7a06df1ec13ada60e17dbdc3 |
| PageCount | 4 |
| ParticipantIDs | ieee_primary_1216754 |
| PublicationCentury | 2000 |
| PublicationDate | 2003-01-01 |
| PublicationDateYYYYMMDD | 2003-01-01 |
| PublicationDate_xml | – month: 01 year: 2003 text: 2003-01-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | 2003 IEEE Information Theory Workshop : proceedings : La Sorbonne, Paris, France, 31 March-4 April, 2003 |
| PublicationTitleAbbrev | ITW |
| PublicationYear | 2003 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000395185 |
| Score | 1.6987383 |
| Snippet | The paper considers linear matrices for a coding problem for multiple access networks. It is proved that we can construct codes by using sparse matrices, which... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 304 |
| SubjectTerms | Additive noise Channel coding Decoding Entropy Error probability Linear code Parity check codes Performance analysis Source coding Sparse matrices |
| Title | Low density parity check matrices for coding of multiple access networks |
| URI | https://ieeexplore.ieee.org/document/1216754 |
| WOSCitedRecordID | wos000184542400075&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61eNCLj1Z8k4NHt812k83mLJYKUnqo2FtJMhMo4q60W8V_7ybdrgpePOVxCCFDmMnkm-8j5MY48JnAQaRdChEHlJFJGUacc6GENkooCGITcjzOZjM1aZHbphYGEQP4DHu-G_7yobBrnyrrx4O4im_5DtmRMt3UajX5FJZUsUImwss8Y55GT9WUTs04235TMtV_mD4HMtBeveYvcZXgW4YH_9vVIel-F-nRSeN-jkgL82Oy_4NfsENGj8UHBQ9RLz-plxusmspI9oW-BmZ-XNEqZqW28CvQwtEtvJDqoKNI8w1IfNUlT8P76d0oqqUTokUS8zLSCWgnmeXCDIBzg0ppY1PJnARhEieNcZhh7KRmKbgYbZxo0JWVYgkGbHJC2nmR4ymhyoIFrQAZ2urCZ0pniRZCWgDQUtkz0vFnMn_bsGPM6-M4_3v6guwFOFxIYlySdrlc4xXZte_lYrW8Dib9AvsBogQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61CurFRyu-zcGj22Z3k83mLEqLtfRQsbeSZBIo4q60W8V_7ybdrgpePOVxCCFDmMnkm-9D6FpZcJnAKJA2gYCC4YFKiAkopUwwqQQT4MUm-HCYTiZi1EA3dS2MMcaDz0zHdf1fPuR66VJl3TAKy_iWbqBNRmlEVtVadUaFxGW0kDL_Nk-JI9ITFalTPU7XH5VEdPvjZ08H2qlW_SWv4r3L_d7_9rWP2t9lenhUO6AD1DDZIdr9wTDYQr1B_oHBgdSLT-wEB8umNJN-wa-em98scBm1Yp27FXBu8RpgiKVXUsTZCia-aKOn-7vxbS-oxBOCWRzSIpAxSMuJpkxFQKkyQkilE04sB6Ziy5WyJjWh5ZIkYEOjw1iCLO0UclCg4yPUzPLMHCMsNGiQAgwxurzyqZBpLBnjGgAkF_oEtdyZTN9W_BjT6jhO_56-Qtu98eNgOugPH87QjgfH-ZTGOWoW86W5QFv6vZgt5pfevF-ZK6VL |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2003+IEEE+Information+Theory+Workshop+%3A+proceedings+%3A+La+Sorbonne%2C+Paris%2C+France%2C+31+March-4+April%2C+2003&rft.atitle=Low+density+parity+check+matrices+for+coding+of+multiple+access+networks&rft.au=Muramatsu%2C+J.&rft.au=Uyematsu%2C+T.&rft.au=Wadayama%2C+T.&rft.date=2003-01-01&rft.pub=IEEE&rft.isbn=9780780377998&rft.spage=304&rft.epage=307&rft_id=info:doi/10.1109%2FITW.2003.1216754&rft.externalDocID=1216754 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780377998/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780377998/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780377998/sc.gif&client=summon&freeimage=true |