Rate-adaptive codes for distributed source coding
Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on low-density parity-check...
Uloženo v:
| Vydáno v: | Signal processing Ročník 86; číslo 11; s. 3123 - 3130 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier B.V
01.11.2006
|
| Témata: | |
| ISSN: | 0165-1684, 1872-7557 |
| 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 | Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on low-density parity-check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be better than alternatives of linear encoding and decoding complexity. The proposed rate-adaptive LDPC accumulate (LDPCA) codes and sum LDPC accumulate (SLDPCA) codes (of length 6336 bits) perform within 10% and 5% of the Slepian–Wolf bound in the moderate and high rate regimes, respectively. |
|---|---|
| AbstractList | Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical dependencies between source and side information. Two classes of rate-adaptive distributed source codes, both based on low-density parity-check (LDPC) codes, are developed and their design is studied. Specific realizations are shown to be better than alternatives of linear encoding and decoding complexity. The proposed rate-adaptive LDPC accumulate (LDPCA) codes and sum LDPC accumulate (SLDPCA) codes (of length 6336 bits) perform within 10% and 5% of the Slepian–Wolf bound in the moderate and high rate regimes, respectively. |
| Author | Aaron, Anne Varodayan, David Girod, Bernd |
| Author_xml | – sequence: 1 givenname: David surname: Varodayan fullname: Varodayan, David email: varodayan@stanford.edu – sequence: 2 givenname: Anne surname: Aaron fullname: Aaron, Anne – sequence: 3 givenname: Bernd surname: Girod fullname: Girod, Bernd |
| BookMark | eNqFj8tKAzEYhYNUsK2-gYt5gRn_JJNkdCFI8QYFQXQdcvmnpNRJSdKCb-_UunKhq7M45zvwzchkiAMSckmhoUDl1brJYbVNsWEAsgHeAGUnZEo7xWolhJqQ6TgTNZVde0ZmOa8BgHIJU0JfTcHaeLMtYY-Vix5z1cdU-ZBLCnZX0Fc57pL7LsOwOienvdlkvPjJOXl_uH9bPNXLl8fnxd2ydhxkqb10LbcMXM-F9BKtZ8J3BqWVBjurOsu8YpIpwYTlXW-sE3iNrVKdR9dTPic3x1-XYs4Je-1CMSXEoSQTNpqCPsjrtT7K64O8Bq5H-RFuf8HbFD5M-vwPuz1iOIrtAyadXcDBoQ8JXdE-hr8PvgAuA3kw |
| CitedBy_id | crossref_primary_10_1007_s11042_014_2033_z crossref_primary_10_1109_TCSVT_2010_2090424 crossref_primary_10_1007_s11432_011_4311_y crossref_primary_10_1109_TCOMM_2013_13_120892 crossref_primary_10_1109_JSEN_2013_2257944 crossref_primary_10_1109_TCSVT_2011_2171263 crossref_primary_10_1109_TIP_2012_2215621 crossref_primary_10_1186_1687_6180_2013_156 crossref_primary_10_1007_s11227_016_1736_5 crossref_primary_10_1016_j_sigpro_2010_02_001 crossref_primary_10_1016_j_sigpro_2015_04_013 crossref_primary_10_1016_j_image_2011_06_008 crossref_primary_10_1049_iet_com_2010_0891 crossref_primary_10_1109_TMC_2016_2604262 crossref_primary_10_1109_TIP_2011_2157515 crossref_primary_10_1109_TIP_2013_2293419 crossref_primary_10_1049_el_2012_0400 crossref_primary_10_1109_TSP_2013_2295556 crossref_primary_10_1016_j_jvcir_2012_01_015 crossref_primary_10_1109_ACCESS_2016_2537739 crossref_primary_10_1007_s11042_016_3947_4 crossref_primary_10_1109_LCOMM_2023_3237285 crossref_primary_10_1007_s11042_017_4635_8 crossref_primary_10_1109_LCOMM_2008_080645 crossref_primary_10_1109_TIP_2013_2288913 crossref_primary_10_1109_TCOMM_2019_2903498 crossref_primary_10_1016_j_ijleo_2013_09_065 crossref_primary_10_1587_transinf_E94_D_1641 crossref_primary_10_1109_TCOMM_2013_112613_120796 crossref_primary_10_1007_s11042_010_0473_7 crossref_primary_10_1186_1687_6180_2011_76 crossref_primary_10_1007_s11128_017_1709_5 crossref_primary_10_1016_j_image_2008_04_004 crossref_primary_10_1145_2530279 crossref_primary_10_1109_LSP_2012_2198815 crossref_primary_10_1016_j_image_2008_04_009 crossref_primary_10_1109_LCOMM_2009_091152 crossref_primary_10_1109_TIP_2011_2175936 crossref_primary_10_1109_MSP_2007_904808 crossref_primary_10_1109_TSP_2009_2014280 crossref_primary_10_1109_TCSVT_2010_2077472 crossref_primary_10_1155_2012_783798 crossref_primary_10_1109_TCOMM_2013_120413_130102 crossref_primary_10_1186_1687_6180_2014_174 crossref_primary_10_1007_s11042_012_1050_z crossref_primary_10_1109_TSP_2014_2300039 crossref_primary_10_1109_TCSVT_2011_2105596 crossref_primary_10_1109_JSEN_2017_2653100 crossref_primary_10_1007_s11042_009_0314_8 crossref_primary_10_1016_j_jvcir_2017_07_007 crossref_primary_10_1109_MBITS_2023_3262237 crossref_primary_10_1155_2009_158982 crossref_primary_10_1007_s11760_025_04049_z crossref_primary_10_1049_iet_ipr_2008_0207 crossref_primary_10_1109_TCOMM_2011_101011_110071 crossref_primary_10_1109_TSP_2009_2023359 crossref_primary_10_1109_LCOMM_2009_090749 crossref_primary_10_1007_s11042_020_08811_y crossref_primary_10_1007_s11042_016_3992_z crossref_primary_10_1109_TIP_2009_2028251 crossref_primary_10_1109_TSP_2009_2018603 crossref_primary_10_1109_TSP_2010_2089622 crossref_primary_10_1109_LCOMM_2009_081247 crossref_primary_10_1109_TCSVT_2011_2154790 crossref_primary_10_1109_TBC_2012_2187611 crossref_primary_10_1109_TCOMM_2013_111313_130230 crossref_primary_10_1109_TCSVT_2011_2147210 crossref_primary_10_1007_s11277_008_9541_y crossref_primary_10_1186_s40064_015_1300_4 crossref_primary_10_1109_TIP_2011_2181400 crossref_primary_10_1109_TVT_2013_2285020 crossref_primary_10_1049_iet_ipr_2018_5942 crossref_primary_10_1177_1550147718787109 crossref_primary_10_1007_s00530_009_0179_8 crossref_primary_10_4028_www_scientific_net_AMM_752_753_1110 crossref_primary_10_3390_app12136505 crossref_primary_10_1109_TSIPN_2020_2981263 crossref_primary_10_1109_TBC_2016_2515545 crossref_primary_10_1109_TSP_2009_2018617 crossref_primary_10_1109_LCOMM_2012_092112_120791 crossref_primary_10_1109_TMM_2008_2007324 crossref_primary_10_1109_TCSVT_2013_2276535 crossref_primary_10_1049_el_2012_2470 crossref_primary_10_1109_TCOMM_2012_080212_110108A crossref_primary_10_1109_TCSVT_2015_2416562 crossref_primary_10_1109_TCSVT_2011_2133830 crossref_primary_10_1109_LCOMM_2011_080811_111232 crossref_primary_10_1109_TCSVT_2011_2129050 crossref_primary_10_1109_JSYST_2015_2414662 crossref_primary_10_1109_JSEN_2016_2585042 crossref_primary_10_1109_TMM_2014_2316154 crossref_primary_10_1016_j_cnsns_2012_05_021 crossref_primary_10_1109_TCOMM_2012_070912_110062 crossref_primary_10_1007_s11760_009_0141_4 crossref_primary_10_1109_LCOMM_2014_2349986 crossref_primary_10_1007_s11042_011_0970_3 crossref_primary_10_1016_j_image_2009_09_004 crossref_primary_10_1109_TMM_2012_2196510 crossref_primary_10_1109_ACCESS_2016_2604358 crossref_primary_10_1186_1687_6180_2013_177 crossref_primary_10_1109_TIP_2014_2320364 crossref_primary_10_1109_TCOMM_2014_010414_130440 crossref_primary_10_1109_TCOMM_2016_2607745 crossref_primary_10_1016_j_image_2008_03_002 crossref_primary_10_1186_1687_1499_2012_106 crossref_primary_10_1109_TCSVT_2015_2418611 crossref_primary_10_1016_j_sigpro_2016_11_003 |
| Cites_doi | 10.1109/TIT.1974.1055186 10.1109/18.910580 10.1109/TIT.2002.808103 10.1109/TIT.1975.1055470 10.1109/TIT.2003.821995 10.1109/4234.957380 10.1109/TIT.1974.1055171 10.1109/TIT.1976.1055508 10.1109/26.848555 10.1016/S0019-9958(78)90034-7 10.1109/LCOMM.2005.02009 10.1109/TIT.2002.1003839 10.1109/LCOMM.2002.804244 10.1109/TCOMM.2004.833022 10.1109/18.910572 10.1109/TIT.1973.1055037 10.1109/TCOMM.2004.826367 |
| ContentType | Journal Article |
| Copyright | 2006 Elsevier B.V. |
| Copyright_xml | – notice: 2006 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.sigpro.2006.03.012 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1872-7557 |
| EndPage | 3130 |
| ExternalDocumentID | 10_1016_j_sigpro_2006_03_012 S0165168406001149 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 123 1B1 1~. 1~5 4.4 457 4G. 53G 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABFNM ABFRF ABMAC ABXDB ABYKQ ACDAQ ACGFO ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADJOM ADMUD ADTZH AEBSH AECPX AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F0J F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ IHE J1W JJJVA KOM LG9 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SEW SPC SPCBC SST SSV SSZ T5K TAE TN5 WUQ XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c306t-d6c43b20cf356d6ebd25d8ae6b6ae8b78b2d72627525b38fabc5e9e4778decf13 |
| ISICitedReferencesCount | 227 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000241093500005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0165-1684 |
| IngestDate | Tue Nov 18 22:27:08 EST 2025 Sat Nov 29 02:13:22 EST 2025 Fri Feb 23 02:28:11 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 11 |
| Keywords | Iterative decoding algorithms Side information Slepian–Wolf theorem LDPC codes Distributed source coding |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-d6c43b20cf356d6ebd25d8ae6b6ae8b78b2d72627525b38fabc5e9e4778decf13 |
| PageCount | 8 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_sigpro_2006_03_012 crossref_primary_10_1016_j_sigpro_2006_03_012 elsevier_sciencedirect_doi_10_1016_j_sigpro_2006_03_012 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-11-01 |
| PublicationDateYYYYMMDD | 2006-11-01 |
| PublicationDate_xml | – month: 11 year: 2006 text: 2006-11-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationTitle | Signal processing |
| PublicationYear | 2006 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Aaron, Girod (bib8) 2002 Rowitch, Milstein (bib13) 2000; 48 Pradhan, Ramchandran (bib7) 2003; 49 Gallager (bib20) 1963 Hellman (bib5) 1975; 21 Slepian, Wolf (bib1) 1973; 19 Bajcsy, Mitran (bib10) 2001 Kschischang, Frey, Loeliger (bib21) 2001; 47 Pishro-Nik, Fekri (bib17) 2004 Wyner (bib6) 1974; 20 Di, Proietti, Telatar, Richardson, Urbanke (bib28) 2002; 48 ten Brink (bib15) 2000; 54 Tian, Jones, Villasenor, Wesel (bib29) 2003 Wyner (bib3) 1978; 38 Yang, Ryan, Li (bib22) 2004; 52 Ha, McLaughlin (bib16) 2003 Chen, Khisti, Malioutov, Yedidia (bib19) 2004 Liveris, Xiong, Georghiades (bib11) 2002; 6 A. Amraoui, LTHC: LdpcOpt (2001). URL Wyner, Ziv (bib2) 1976; 22 Hagenauer, Barros, Schaeffer (bib14) 2004 R.B. Blizard, Convolutional coding for data compression, Martin Marietta Corp., Denver Div., Rep. R-69-17, 1969. Ramamoorthy, Wesel (bib30) 2004 Bahl, Cocke, Jelinek, Raviv (bib25) 1974; 20 Li, Narayanan, Georghiades (bib23) 2004; 50 . Isaka, Fossorier (bib24) 2005; 9 Aaron, Rane, Setton, Girod (bib12) 2004 Sesia, Caire, Vivier (bib18) 2004; 52 García-Frías (bib9) 2001; 5 Chung, Richardson, Urbanke (bib26) 2001; 47 García-Frías (10.1016/j.sigpro.2006.03.012_bib9) 2001; 5 Li (10.1016/j.sigpro.2006.03.012_bib23) 2004; 50 Aaron (10.1016/j.sigpro.2006.03.012_bib8) 2002 Wyner (10.1016/j.sigpro.2006.03.012_bib6) 1974; 20 Bahl (10.1016/j.sigpro.2006.03.012_bib25) 1974; 20 Tian (10.1016/j.sigpro.2006.03.012_bib29) 2003 Gallager (10.1016/j.sigpro.2006.03.012_bib20) 1963 10.1016/j.sigpro.2006.03.012_bib4 Bajcsy (10.1016/j.sigpro.2006.03.012_bib10) 2001 Di (10.1016/j.sigpro.2006.03.012_bib28) 2002; 48 Chen (10.1016/j.sigpro.2006.03.012_bib19) 2004 Pradhan (10.1016/j.sigpro.2006.03.012_bib7) 2003; 49 Ha (10.1016/j.sigpro.2006.03.012_bib16) 2003 ten Brink (10.1016/j.sigpro.2006.03.012_bib15) 2000; 54 Kschischang (10.1016/j.sigpro.2006.03.012_bib21) 2001; 47 Yang (10.1016/j.sigpro.2006.03.012_bib22) 2004; 52 10.1016/j.sigpro.2006.03.012_bib27 Chung (10.1016/j.sigpro.2006.03.012_bib26) 2001; 47 Hellman (10.1016/j.sigpro.2006.03.012_bib5) 1975; 21 Sesia (10.1016/j.sigpro.2006.03.012_bib18) 2004; 52 Aaron (10.1016/j.sigpro.2006.03.012_bib12) 2004 Wyner (10.1016/j.sigpro.2006.03.012_bib3) 1978; 38 Pishro-Nik (10.1016/j.sigpro.2006.03.012_bib17) 2004 Liveris (10.1016/j.sigpro.2006.03.012_bib11) 2002; 6 Rowitch (10.1016/j.sigpro.2006.03.012_bib13) 2000; 48 Isaka (10.1016/j.sigpro.2006.03.012_bib24) 2005; 9 Hagenauer (10.1016/j.sigpro.2006.03.012_bib14) 2004 Ramamoorthy (10.1016/j.sigpro.2006.03.012_bib30) 2004 Slepian (10.1016/j.sigpro.2006.03.012_bib1) 1973; 19 Wyner (10.1016/j.sigpro.2006.03.012_bib2) 1976; 22 |
| References_xml | – volume: 6 start-page: 440 year: 2002 end-page: 442 ident: bib11 article-title: Compression of binary sources with side information at the decoder using LDPC codes publication-title: IEEE Commun. Lett. – year: 2003 ident: bib16 article-title: Optimal puncturing of irregular low-density parity-check codes publication-title: Proceedings of the IEEE International Conference on Communications – year: 2001 ident: bib10 article-title: Coding for the Slepian–Wolf problem with turbo codes publication-title: Proceedings of the IEEE Global Communications Conference – year: 2004 ident: bib14 article-title: Lossless turbo source coding with decremental redundancy publication-title: Proceedings of the Fifth ITG Conference on Source and Channel Coding – year: 2004 ident: bib17 article-title: Results on punctured LDPC codes publication-title: IEEE Information Theory Workshop – reference: A. Amraoui, LTHC: LdpcOpt (2001). URL – year: 2004 ident: bib30 article-title: Construction of short block length irregular low-density parity-check codes publication-title: Proceedings of the IEEE International Conference on Communications – year: 2003 ident: bib29 article-title: Construction of irregular LDPC codes with low error floors publication-title: Proceedings of the IEEE International Conference on Communications – volume: 49 start-page: 626 year: 2003 end-page: 643 ident: bib7 article-title: Distributed source coding using syndromes (DISCUS): design and construction publication-title: IEEE Trans. Inform. Theory – reference: R.B. Blizard, Convolutional coding for data compression, Martin Marietta Corp., Denver Div., Rep. R-69-17, 1969. – volume: 52 start-page: 1311 year: 2004 end-page: 1321 ident: bib18 article-title: Incremental redundancy hybrid ARQ based on low-density parity-check codes publication-title: IEEE Trans. Commun. – volume: 20 start-page: 2 year: 1974 end-page: 10 ident: bib6 article-title: Recent results in the Shannon theory publication-title: IEEE Trans. Inform. Theory – volume: 48 start-page: 1570 year: 2002 end-page: 1579 ident: bib28 article-title: Finite-length analysis of low-density parity-check codes on the binary erasure channel publication-title: IEEE Trans. Inform. Theory – volume: 47 start-page: 498 year: 2001 end-page: 519 ident: bib21 article-title: Factor graphs and the sum–product algorithm publication-title: IEEE Trans. Inform. Theory – volume: 50 start-page: 31 year: 2004 end-page: 46 ident: bib23 article-title: Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity publication-title: IEEE Trans. Inform. Theory – volume: 22 start-page: 1 year: 1976 end-page: 10 ident: bib2 article-title: The rate-distortion function for source coding with side information at the decoder publication-title: IEEE Trans. Inform. Theory – volume: 54 start-page: 389 year: 2000 end-page: 398 ident: bib15 article-title: Designing iterative decoding schemes with the extrinsic information transfer chart publication-title: AEÜ Int. J. Electron. Commun. – year: 1963 ident: bib20 article-title: Low-density Parity-check Codes – volume: 47 start-page: 657 year: 2001 end-page: 670 ident: bib26 article-title: Analysis of sum–product decoding of low-density parity-check codes using a Gaussian approximation publication-title: IEEE Trans. Inform. Theory – volume: 48 start-page: 948 year: 2000 end-page: 959 ident: bib13 article-title: On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes publication-title: IEEE Trans. Commun. – volume: 19 start-page: 471 year: 1973 end-page: 480 ident: bib1 article-title: Noiseless coding of correlated information sources publication-title: IEEE Trans. Inform. Theory – volume: 9 start-page: 160 year: 2005 end-page: 162 ident: bib24 article-title: High rate serially concatenated coding with extended Hamming codes publication-title: IEEE Commun. Lett. – year: 2004 ident: bib19 article-title: Distributed source coding using serially-concatenated-accumulate codes publication-title: IEEE Information Theory Workshop – volume: 21 start-page: 651 year: 1975 end-page: 656 ident: bib5 article-title: Convolutional source encoding publication-title: IEEE Trans. Inform. Theory – year: 2002 ident: bib8 article-title: Compression with side information using turbo codes publication-title: Proceedings of the IEEE Data Compression Conference – volume: 5 start-page: 417 year: 2001 end-page: 419 ident: bib9 article-title: Compression of correlated binary sources using turbo codes publication-title: IEEE Commun. Lett. – volume: 20 start-page: 284 year: 1974 end-page: 287 ident: bib25 article-title: Optimal decoding of linear codes for minimizing symbol error publication-title: IEEE Trans. Inform. Theory – volume: 52 start-page: 564 year: 2004 end-page: 571 ident: bib22 article-title: Design of efficiently encodable moderate-length high-rate irregular LDPC codes publication-title: IEEE Trans. Commun. – volume: 38 start-page: 60 year: 1978 end-page: 80 ident: bib3 article-title: The rate-distortion function for source coding with side information at the decoder-II: general sources publication-title: Inform. Control – reference: . – year: 2004 ident: bib12 article-title: Transform-domain Wyner–Ziv codec for video publication-title: SPIE Visual Communications and Image Processing Conference – year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib12 article-title: Transform-domain Wyner–Ziv codec for video – volume: 20 start-page: 284 issue: 2 year: 1974 ident: 10.1016/j.sigpro.2006.03.012_bib25 article-title: Optimal decoding of linear codes for minimizing symbol error publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.1974.1055186 – volume: 47 start-page: 657 issue: 2 year: 2001 ident: 10.1016/j.sigpro.2006.03.012_bib26 article-title: Analysis of sum–product decoding of low-density parity-check codes using a Gaussian approximation publication-title: IEEE Trans. Inform. Theory doi: 10.1109/18.910580 – volume: 49 start-page: 626 issue: 3 year: 2003 ident: 10.1016/j.sigpro.2006.03.012_bib7 article-title: Distributed source coding using syndromes (DISCUS): design and construction publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.2002.808103 – volume: 21 start-page: 651 issue: 6 year: 1975 ident: 10.1016/j.sigpro.2006.03.012_bib5 article-title: Convolutional source encoding publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.1975.1055470 – year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib17 article-title: Results on punctured LDPC codes – volume: 50 start-page: 31 issue: 1 year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib23 article-title: Product accumulate codes: a class of codes with near-capacity performance and low decoding complexity publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.2003.821995 – year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib30 article-title: Construction of short block length irregular low-density parity-check codes – ident: 10.1016/j.sigpro.2006.03.012_bib27 – year: 2003 ident: 10.1016/j.sigpro.2006.03.012_bib29 article-title: Construction of irregular LDPC codes with low error floors – volume: 5 start-page: 417 issue: 10 year: 2001 ident: 10.1016/j.sigpro.2006.03.012_bib9 article-title: Compression of correlated binary sources using turbo codes publication-title: IEEE Commun. Lett. doi: 10.1109/4234.957380 – volume: 20 start-page: 2 issue: 1 year: 1974 ident: 10.1016/j.sigpro.2006.03.012_bib6 article-title: Recent results in the Shannon theory publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.1974.1055171 – volume: 22 start-page: 1 issue: 1 year: 1976 ident: 10.1016/j.sigpro.2006.03.012_bib2 article-title: The rate-distortion function for source coding with side information at the decoder publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.1976.1055508 – year: 2002 ident: 10.1016/j.sigpro.2006.03.012_bib8 article-title: Compression with side information using turbo codes – volume: 48 start-page: 948 issue: 6 year: 2000 ident: 10.1016/j.sigpro.2006.03.012_bib13 article-title: On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes publication-title: IEEE Trans. Commun. doi: 10.1109/26.848555 – year: 2003 ident: 10.1016/j.sigpro.2006.03.012_bib16 article-title: Optimal puncturing of irregular low-density parity-check codes – year: 2001 ident: 10.1016/j.sigpro.2006.03.012_bib10 article-title: Coding for the Slepian–Wolf problem with turbo codes – year: 1963 ident: 10.1016/j.sigpro.2006.03.012_bib20 – volume: 38 start-page: 60 issue: 1 year: 1978 ident: 10.1016/j.sigpro.2006.03.012_bib3 article-title: The rate-distortion function for source coding with side information at the decoder-II: general sources publication-title: Inform. Control doi: 10.1016/S0019-9958(78)90034-7 – year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib14 article-title: Lossless turbo source coding with decremental redundancy – ident: 10.1016/j.sigpro.2006.03.012_bib4 – volume: 9 start-page: 160 issue: 2 year: 2005 ident: 10.1016/j.sigpro.2006.03.012_bib24 article-title: High rate serially concatenated coding with extended Hamming codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2005.02009 – year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib19 article-title: Distributed source coding using serially-concatenated-accumulate codes – volume: 48 start-page: 1570 issue: 6 year: 2002 ident: 10.1016/j.sigpro.2006.03.012_bib28 article-title: Finite-length analysis of low-density parity-check codes on the binary erasure channel publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.2002.1003839 – volume: 6 start-page: 440 issue: 10 year: 2002 ident: 10.1016/j.sigpro.2006.03.012_bib11 article-title: Compression of binary sources with side information at the decoder using LDPC codes publication-title: IEEE Commun. Lett. doi: 10.1109/LCOMM.2002.804244 – volume: 52 start-page: 1311 issue: 8 year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib18 article-title: Incremental redundancy hybrid ARQ based on low-density parity-check codes publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2004.833022 – volume: 47 start-page: 498 issue: 2 year: 2001 ident: 10.1016/j.sigpro.2006.03.012_bib21 article-title: Factor graphs and the sum–product algorithm publication-title: IEEE Trans. Inform. Theory doi: 10.1109/18.910572 – volume: 19 start-page: 471 issue: 4 year: 1973 ident: 10.1016/j.sigpro.2006.03.012_bib1 article-title: Noiseless coding of correlated information sources publication-title: IEEE Trans. Inform. Theory doi: 10.1109/TIT.1973.1055037 – volume: 54 start-page: 389 issue: 6 year: 2000 ident: 10.1016/j.sigpro.2006.03.012_bib15 article-title: Designing iterative decoding schemes with the extrinsic information transfer chart publication-title: AEÜ Int. J. Electron. Commun. – volume: 52 start-page: 564 issue: 4 year: 2004 ident: 10.1016/j.sigpro.2006.03.012_bib22 article-title: Design of efficiently encodable moderate-length high-rate irregular LDPC codes publication-title: IEEE Trans. Commun. doi: 10.1109/TCOMM.2004.826367 |
| SSID | ssj0001360 |
| Score | 2.3436594 |
| Snippet | Source coding with correlated decoder side information is considered. We impose the practical constraint that the encoder be unaware of even the statistical... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 3123 |
| SubjectTerms | Distributed source coding Iterative decoding algorithms LDPC codes Side information Slepian–Wolf theorem |
| Title | Rate-adaptive codes for distributed source coding |
| URI | https://dx.doi.org/10.1016/j.sigpro.2006.03.012 |
| Volume | 86 |
| WOSCitedRecordID | wos000241093500005&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 | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-7557 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001360 issn: 0165-1684 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9wwELa20EN7qKAPQWmrHLh6FcfxI0eKaEsPCLFU2lsUP4IWobAKC-Lnd5xxlixb9SVxiaJ4nY09n8bj8XwzhOwz6yzsMlKaG6sDJSellXAVLZTVjOc17InyrtiEOjnR02lxOhpNei7M3ZVqGn1_X8yfVNTwDIQdqLP_IO7lS-EB3IPQ4Qpih-tfCf4MrEdauWreBQUFynqXciEcxWB1Kx885cFlHxr7lSvap5PZRTBP50gf6Bu7glxtCLhBd-kgEB6gAi0xD8HDEf3XWYuhPJ9927hHrgW24lpY57ygC1IKyiQWdht7VJtagZ0uMNV0r1djiuuIHzbQkpwhxziuuJzh0cyaNkfHwuX4ZnYB444nR3ycxsDr1TzZk_Bh4btS2TGEi2dkM1OiAFW3eXB8NP2-XKAZ78jjy4H0jMou7G_9v35tsQyskPMt8ipuH5IDFPs2GfnmNXk5SCr5hrAVACQdABIAQDIAQIIASBAAb8mPL0fnh99oLIxBLezwFtRJm3OTpbbmQjrpjcuE05WXRlZeG6VN5lQW8k9nwnBdV8YKX_hcKe28rRl_Rzaa68bvkCQ1IcDYgOHo0rwGe69WtWbCZIJb5-tql_B-8KWNWeND8ZKrsg8PvCxxykJBU1mmvIQp2yV02WuOWVP-8HvVz2sZLT-06EqAwm97vv_vnnvkxQPmP5CNRXvrP5Ln9m4xu2k_Rcz8BNDHfd0 |
| linkProvider | Elsevier |
| 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%3Ajournal&rft.genre=article&rft.atitle=Rate-adaptive+codes+for+distributed+source+coding&rft.jtitle=Signal+processing&rft.au=Varodayan%2C+David&rft.au=Aaron%2C+Anne&rft.au=Girod%2C+Bernd&rft.date=2006-11-01&rft.pub=Elsevier+B.V&rft.issn=0165-1684&rft.eissn=1872-7557&rft.volume=86&rft.issue=11&rft.spage=3123&rft.epage=3130&rft_id=info:doi/10.1016%2Fj.sigpro.2006.03.012&rft.externalDocID=S0165168406001149 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0165-1684&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0165-1684&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0165-1684&client=summon |