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.
Gespeichert in:
| Veröffentlicht in: | 2003 IEEE Information Theory Workshop : proceedings : La Sorbonne, Paris, France, 31 March-4 April, 2003 S. 304 - 307 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch Japanisch |
| Veröffentlicht: |
IEEE
01.01.2003
|
| Schlagworte: | |
| ISBN: | 0780377990, 9780780377998 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| 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.6989043 |
| 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/eLvHCXMwlV1LSwMxEA5t8aAXH634JgePbptsspvNWSwVSumhYm8lj1ko4q60W8V_b5JuVwUvnvI4DCFDmMnMN98gdKtVYjLLQlyDR1wSHWkrfMLVPa-Ui8RC4Jkdi8kkm8_ltIXumloYAAjgM-j7acjl29JsfKhsQGPq_FveRm0h0m2tVhNPIcz5ClkSfuYZ8TR6sqZ0atbZLk1J5OBx9hzIQPu1zF_NVYJtGR7-71RHqPddpIenjfk5Ri0oTtDBD37BLhqNyw9sPUS9-sS-3aAbnJLMC34NzPywxs5nxab0EnCZ4x28EKvQRxEXW5D4uoeehg-z-1FUt06IlozyKlLMqlwQwxMdW841SKm0SQXJhU00y4XWOWRAc6FIanMKhjJlVUqACqutYaeoU5QFnCFspQSpWExtqrn7jcg81YYRcL5LwhnE56jr72TxtmXHWNTXcfH39iXaD3C4EMS4Qp1qtYFrtGfeq-V6dRNU-gXF8592 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61CurFRyu-zcGj22Y32c3mLEqLa-mhYm8lj1ko4q60W8V_b5K2q4IXT3kchpAhzGTmm28QulYy1qmhPq7BAiaICpThLuFqn1fCeGzA88xmfDBIx2MxbKCbuhYGADz4DDpu6nP5ptQLFyrrhlFo_Vu2gTZjxiKyrNaqIyqEWm8hjf3fPCWOSE-sSJ3qdbpOVBLR7Y-ePR1oZyX1V3sVb13u9_53rn3U_i7Tw8PaAB2gBhSHaPcHw2AL9bLyAxsHUq8-sWs4aAerJv2CXz03P8yx9VqxLp0EXOZ4DTDE0ndSxMUSJj5vo6f7u9FtL1g1TwimNGRVIKmROSeaxSoyjCkQQiqdcJJzEyuac6VySCHMuSSJyUPQIZVGJgRCbpTR9Ag1i7KAY4SNECAkjUKTKGb_IyJPlKYErPcSMwrRCWq5O5m8LfkxJqvrOP17-wpt90aP2STrDx7O0I4Hx_mQxjlqVrMFXKAt_V5N57NLr94vQv2ivQ |
| 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 |