n-channel entropy-constrained multiple-description lattice vector quantization
In this paper, we derive analytical expressions for the central and side quantizers which, under high-resolution assumptions, minimize the expected distortion of a symmetric multiple-description lattice vector quantization (MD-LVQ) system subject to entropy constraints on the side descriptions for g...
Saved in:
| Published in: | IEEE transactions on information theory Vol. 52; no. 5; pp. 1956 - 1973 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
New York, NY
IEEE
01.05.2006
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Subjects: | |
| ISSN: | 0018-9448, 1557-9654 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In this paper, we derive analytical expressions for the central and side quantizers which, under high-resolution assumptions, minimize the expected distortion of a symmetric multiple-description lattice vector quantization (MD-LVQ) system subject to entropy constraints on the side descriptions for given packet-loss probabilities. We consider a special case of the general n-channel symmetric multiple-description problem where only a single parameter controls the redundancy tradeoffs between the central and the side distortions. Previous work on two-channel MD-LVQ showed that the distortions of the side quantizers can be expressed through the normalized second moment of a sphere. We show here that this is also the case for three-channel MD-LVQ. Furthermore, we conjecture that this is true for the general n-channel MD-LVQ. For given source, target rate, and packet-loss probabilities we find the optimal number of descriptions and construct the MD-LVQ system that minimizes the expected distortion. We verify theoretical expressions by numerical simulations and show in a practical setup that significant performance improvements can be achieved over state-of-the-art two-channel MD-LVQ by using three-channel MD-LVQ. |
|---|---|
| AbstractList | In this paper, we derive analytical expressions for the central and side quantizers which, under high-resolution assumptions, minimize the expected distortion of a symmetric multiple-description lattice vector quantization (MD-LVQ) system subject to entropy constraints on the side descriptions for given packet-loss probabilities. We consider a special case of the general n-channel symmetric multiple-description problem where only a single parameter controls the redundancy tradeoffs between the central and the side distortions. Previous work on two-channel MD-LVQ showed that the distortions of the side quantizers can be expressed through the normalized second moment of a sphere. We show here that this is also the case for three-channel MD-LVQ. Furthermore, we conjecture that this is true for the general n-channel MD-LVQ. For given source, target rate, and packet-loss probabilities we find the optimal number of descriptions and construct the MD-LVQ system that minimizes the expected distortion. We verify theoretical expressions by numerical simulations and show in a practical setup that significant performance improvements can be achieved over state-of-the-art two-channel MD-LVQ by using three-channel MD-LVQ. In this paper, we derive analytical expressions for the central and side quantizers which, under high-resolution assumptions, minimize the expected distortion of a symmetric multiple-description lattice vector quantization (MD-LVQ) system subject to entropy constraints on the side descriptions for given packet-loss probabilities. We consider a special case of the general n-channel symmetric multiple-description problem where only a single parameter controls the redundancy tradeoffs between the central and the side distortions. Previous work on two-channel MD-LVQ showed that the distortions of the side quantizers can be expressed through the normalized second moment of a sphere. We show here that this is also the case for three-channel MD-LVQ. Furthermore, we conjecture that this is true for the general n-channel MD-LVQ. For given source, target rate, and packet-loss probabilities we find the optimal number of descriptions and construct the MD-LVQ system that minimizes the expected distortion. We verify theoretical expressions by numerical simulations and show in a practical setup that significant performance improvements can be achieved over state-of-the-art two-channel MD-LVQ by using three-channel MD-LVQ. [PUBLICATION ABSTRACT] |
| Author | Ostergaard, J. Jensen, J. Heusdens, R. |
| Author_xml | – sequence: 1 givenname: J. surname: Ostergaard fullname: Ostergaard, J. organization: Dept. of Inf. & Commun. Theor., Delft Univ. of Technol., Netherlands – sequence: 2 givenname: J. surname: Jensen fullname: Jensen, J. organization: Dept. of Inf. & Commun. Theor., Delft Univ. of Technol., Netherlands – sequence: 3 givenname: R. surname: Heusdens fullname: Heusdens, R. organization: Dept. of Inf. & Commun. Theor., Delft Univ. of Technol., Netherlands |
| BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17798748$$DView record in Pascal Francis |
| BookMark | eNp9kU1rVDEUhoNUcFpdu3BzERQ3d5rk5nMpxY9C0c24DpncE0zJJLdJrlB_vRmnUOiiq5Cc583hnOccnaWcAKG3BG8Jwfpyd73bUozFVkmqmHyBNoRzOWrB2RnaYEzUqBlTr9B5rbf9yjihG_Qjje63TQniAKmVvNyPLqfaig0J5uGwxhaWCOMM1ZWwtJDTEG1rwcHwB1zLZbhbbWrhrz3WXqOX3sYKbx7OC_Tr65fd1ffx5ue366vPN6NjdGojt3amFmvqtJYz7P2e7gkIIaUDwWcsJNVeE6fdLDHxRPn-6IXSE5Be8dMF-nj6dyn5boXazCFUBzHaBHmthipMhRa0g5-eBckkOOFsErqj75-gt3ktqY9hiOaa0I526MMDZKuz0RebXKhmKeFgy70hUmolmerc5YlzJddawD8i2Bx9me7LHH2Zk6-e4E8SLrT_Sz3KiM_k3p1yAQAeuwjKxMSmf0rqpKc |
| CODEN | IETTAW |
| CitedBy_id | crossref_primary_10_1186_s13634_016_0343_1 crossref_primary_10_1109_TIT_2010_2080411 crossref_primary_10_1109_JSTSP_2008_922511 crossref_primary_10_1109_TSP_2011_2159601 crossref_primary_10_1109_TCNS_2022_3165514 crossref_primary_10_1109_TSP_2013_2286773 crossref_primary_10_1109_TCOMM_2017_2704585 crossref_primary_10_1109_TCOMM_2020_2987565 crossref_primary_10_1016_j_sigpro_2008_05_020 crossref_primary_10_1109_TIT_2009_2027528 crossref_primary_10_1186_1687_4722_2014_16 crossref_primary_10_1109_TCOMM_2014_2367014 crossref_primary_10_1109_TIP_2013_2288928 crossref_primary_10_1109_TCOMM_2018_2816070 crossref_primary_10_1109_TSP_2008_928933 crossref_primary_10_1109_TCOMM_2014_022314_120896 crossref_primary_10_1109_TSP_2012_2199315 crossref_primary_10_1109_TIT_2015_2413780 crossref_primary_10_1109_TCOMM_2011_051711_100254 crossref_primary_10_1109_TCOMM_2012_12_100562 crossref_primary_10_1109_TSP_2009_2016873 crossref_primary_10_1109_TCST_2013_2253464 crossref_primary_10_1016_j_sigpro_2011_03_023 crossref_primary_10_1109_ACCESS_2018_2886823 crossref_primary_10_1109_TCSVT_2010_2045820 |
| Cites_doi | 10.1109/TIT.2004.834748 10.1109/18.945243 10.1109/ICASSP.2004.1326898 10.1007/978-3-0348-7185-3 10.1109/18.930913 10.1109/MMSP.1997.602671 10.1007/BF00147862 10.1109/TCOMM.2003.809727 10.1109/TIT.2003.821998 10.1007/BF01571276 10.1109/TIT.2002.1003832 10.1109/ISIT.2006.261982 10.1109/DCC.1999.755656 10.1109/DCC.2000.838188 10.1109/18.75242 10.1109/DCC.2002.999964 10.1109/TSP.2003.820088 10.1109/icip.2000.900977 10.1109/18.887860 10.1007/978-1-4757-6568-7 10.1109/DCC.1999.755648 10.1016/S0065-2539(08)60560-0 10.1109/18.272491 10.1109/79.952806 10.1109/18.651044 10.1017/S0004972700030252 10.1515/9781400873173 10.1109/ISIT.2005.1523654 10.1109/DCC.2000.838189 10.1109/DCC.2004.1281448 10.1109/ISIT.1998.708685 10.1109/18.986048 10.1109/ICIP.1997.647986 10.1109/TIT.2002.802643 10.1109/26.771331 10.1109/18.256491 10.1109/DCC.1999.755649 10.1109/DCC.2005.56 10.1109/18.971747 10.1109/TIT.2004.833344 10.1002/j.1538-7305.1980.tb03344.x 10.1109/TIT.1982.1056588 |
| ContentType | Journal Article |
| Copyright | 2006 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2006 |
| Copyright_xml | – notice: 2006 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) May 2006 |
| DBID | 97E RIA RIE AAYXX CITATION IQODW 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| DOI | 10.1109/TIT.2006.872847 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Pascal-Francis Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Technology Research Database Technology Research Database Computer and Information Systems Abstracts |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Applied Sciences |
| EISSN | 1557-9654 |
| EndPage | 1973 |
| ExternalDocumentID | 1048755341 17798748 10_1109_TIT_2006_872847 1624634 |
| Genre | orig-research Feature |
| GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION IQODW RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
| ID | FETCH-LOGICAL-c423t-5aad2a092c997debfb2b1e6677ce65d06729f91c9cd701f18f5d0f6893e129ff3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 44 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000237147400010&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0018-9448 |
| IngestDate | Thu Oct 02 10:10:30 EDT 2025 Thu Oct 02 20:46:45 EDT 2025 Mon Jun 30 04:54:23 EDT 2025 Mon Jul 21 09:16:39 EDT 2025 Sat Nov 29 08:02:09 EST 2025 Tue Nov 18 21:52:30 EST 2025 Tue Aug 26 16:40:38 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 5 |
| Keywords | Performance evaluation Packet switching State of the art High resolution Vector quantization Redundancy Data compression Two channel system Loss rate Data transmission n channel Entropy multiple-description coding (MDC) Analytical method Numerical simulation Quantifier Transmission loss Multiple channel lattice quantization High-rate quantization |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html CC BY 4.0 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c423t-5aad2a092c997debfb2b1e6677ce65d06729f91c9cd701f18f5d0f6893e129ff3 |
| Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
| OpenAccessLink | http://resolver.tudelft.nl/uuid:1b22fc7a-ffd3-44ce-bfa2-9d90fdd2ed4b |
| PQID | 195912365 |
| PQPubID | 23500 |
| PageCount | 18 |
| ParticipantIDs | crossref_primary_10_1109_TIT_2006_872847 proquest_miscellaneous_1365154369 ieee_primary_1624634 crossref_citationtrail_10_1109_TIT_2006_872847 proquest_journals_195912365 proquest_miscellaneous_28026962 pascalfrancis_primary_17798748 |
| PublicationCentury | 2000 |
| PublicationDate | 2006-05-01 |
| PublicationDateYYYYMMDD | 2006-05-01 |
| PublicationDate_xml | – month: 05 year: 2006 text: 2006-05-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York, NY |
| PublicationPlace_xml | – name: New York, NY – name: New York |
| PublicationTitle | IEEE transactions on information theory |
| PublicationTitleAbbrev | TIT |
| PublicationYear | 2006 |
| Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 ref12 ref15 ref14 Pradhan (ref24) ref53 ref11 ref55 ref10 ref54 ref17 ref16 ref19 ref18 Coxeter (ref40) 1973 Erdös (ref44) 1989; 39 ref50 Gray (ref36) 1990 ref45 Vinograd (ref46) 1963; 27 ref42 ref43 ref8 ref7 ref9 ref4 ref3 ref6 ref5 Ericson (ref39) 2001 ref35 ref34 Pradhan (ref26) ref31 ref30 ref33 Gersho (ref41) 1991 ref32 ref2 ref1 ref38 Krätzel (ref48) 1988 Conway (ref37) 1999 West (ref49) 2001 Rainville (ref51) 1960 ref23 ref25 Graham (ref52) 1994 ref20 Gruber (ref47) 1987 ref22 ref21 ref28 ref27 ref29 |
| References_xml | – ident: ref15 doi: 10.1109/TIT.2004.834748 – ident: ref19 doi: 10.1109/18.945243 – ident: ref50 doi: 10.1109/ICASSP.2004.1326898 – ident: ref43 doi: 10.1007/978-3-0348-7185-3 – ident: ref13 doi: 10.1109/18.930913 – ident: ref18 doi: 10.1109/MMSP.1997.602671 – volume-title: Source Coding Theory year: 1990 ident: ref36 – ident: ref45 doi: 10.1007/BF00147862 – ident: ref9 doi: 10.1109/TCOMM.2003.809727 – ident: ref23 doi: 10.1109/TIT.2003.821998 – ident: ref42 doi: 10.1007/BF01571276 – ident: ref22 doi: 10.1109/TIT.2002.1003832 – ident: ref34 doi: 10.1109/ISIT.2006.261982 – volume-title: Geometry of Numbers year: 1987 ident: ref47 – volume-title: Introduction to Graph Theory year: 2001 ident: ref49 – ident: ref21 doi: 10.1109/DCC.1999.755656 – ident: ref33 doi: 10.1109/DCC.2000.838188 – ident: ref35 doi: 10.1109/18.75242 – ident: ref25 doi: 10.1109/DCC.2002.999964 – ident: ref10 doi: 10.1109/TSP.2003.820088 – ident: ref7 doi: 10.1109/icip.2000.900977 – ident: ref20 doi: 10.1109/18.887860 – volume-title: Regular Polytopes year: 1973 ident: ref40 – volume-title: Sphere Packings, Lattices and Groups year: 1999 ident: ref37 doi: 10.1007/978-1-4757-6568-7 – ident: ref8 doi: 10.1109/DCC.1999.755648 – volume-title: IEEE International Symposium on Information Theory (Special Session on “Recent Results”) ident: ref26 article-title: MDS source-channel erasure codes – ident: ref38 doi: 10.1016/S0065-2539(08)60560-0 – volume-title: Vector Quantization and Signal Compression year: 1991 ident: ref41 – volume-title: Proc. Conf. Information Sciences and Systems ident: ref24 article-title: (n,k) source-channel erasure codes: Can parity bits also refine quality? – volume-title: Codes on Euclidean Spheres year: 2001 ident: ref39 – ident: ref2 doi: 10.1109/18.272491 – ident: ref27 doi: 10.1109/79.952806 – ident: ref30 doi: 10.1109/18.651044 – ident: ref54 doi: 10.1017/S0004972700030252 – ident: ref53 doi: 10.1515/9781400873173 – ident: ref55 doi: 10.1109/ISIT.2005.1523654 – ident: ref12 doi: 10.1109/DCC.2000.838189 – ident: ref4 doi: 10.1109/DCC.2004.1281448 – ident: ref5 doi: 10.1109/ISIT.1998.708685 – ident: ref32 doi: 10.1109/18.986048 – ident: ref17 doi: 10.1109/ICIP.1997.647986 – ident: ref3 doi: 10.1109/TIT.2002.802643 – ident: ref6 doi: 10.1109/26.771331 – ident: ref1 doi: 10.1109/18.256491 – ident: ref11 doi: 10.1109/DCC.1999.755649 – volume-title: Concrete Mathematics year: 1994 ident: ref52 – ident: ref16 doi: 10.1109/DCC.2005.56 – volume: 39 volume-title: Lattice Points year: 1989 ident: ref44 – volume: 27 year: 1963 ident: ref46 article-title: On the number of integer points in a sphere publication-title: Izv. Akad. Nauk SSSR—Ser. Mat. – volume-title: Lattice Points year: 1988 ident: ref48 – volume-title: Special Functions year: 1960 ident: ref51 – ident: ref14 doi: 10.1109/18.971747 – ident: ref31 doi: 10.1109/TIT.2004.833344 – ident: ref28 doi: 10.1002/j.1538-7305.1980.tb03344.x – ident: ref29 doi: 10.1109/TIT.1982.1056588 |
| SSID | ssj0014512 |
| Score | 2.057797 |
| Snippet | In this paper, we derive analytical expressions for the central and side quantizers which, under high-resolution assumptions, minimize the expected distortion... |
| SourceID | proquest pascalfrancis crossref ieee |
| SourceType | Aggregation Database Index Database Enrichment Source Publisher |
| StartPage | 1956 |
| SubjectTerms | Applied sciences Centralized control Coding, codes Communication channels Counters Data compression Descriptions Distortion Entropy Exact sciences and technology High-rate quantization Information systems Information, signal and communications theory lattice quantization Lattices Materials science and technology Mathematical analysis Mathematical models multiple-description coding (MDC) Numerical simulation Packet switched networks Probability Sampling, quantization Signal and communications theory Simulation Source coding Switching and signalling Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Transmission and modulation (techniques and equipments) Vector quantization |
| Title | n-channel entropy-constrained multiple-description lattice vector quantization |
| URI | https://ieeexplore.ieee.org/document/1624634 https://www.proquest.com/docview/195912365 https://www.proquest.com/docview/1365154369 https://www.proquest.com/docview/28026962 |
| Volume | 52 |
| WOSCitedRecordID | wos000237147400010&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: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4B4lAOpUBRU1pIpR56qCH2On4cq6qovaw4bCVukWOPJaRVlrK7SP339cTZUNRy4JQoHkuOx2OP5_UBfKy8MJ6ycWx6MGlCxVqsDdNWixirqrVtBpvQ06m5vrZXW_B5zIVBxD74DM_ptfflh4Vfk6nsgish1URuw7bWKudqjR4DWfNcGZwnAU53jqGMD6_sxezHLHsdjKbN-NEJ1EOqUECkW6Y5iRnM4p99uT9sLvefN8xX8HJQKssveRUcwBZ2h7C_AWwoB_k9hL2_qg8ewbRjlPbb4bwkE-_i9jfzpC0SaASGchNqyAKOW0s5dyuKlivve2N_-WudGDNkcr6Gn5ffZl-_swFegfmkQ61Y7VwQrrLCW6sDtrEVLUeltPao6kA-Whst99YHXfHITUwfo0oKDiYlIcbJMex0iw7fQMmlFhhM8NI5iTEaSzhjwpmYeqSWAs43U974ofY4_c286e8glW0SjwgRUzWZRwV8Gjvc5rIbT5MeEQseyPLsF3D6iKcP7Vpbo6Up4GTD5GaQ22VDpXaoHk1dwIexNQkceVFch4t1IpkQerycKFvA2RM0wqSrrVXi7f_HdgIvsiWH4ibfwc7qbo3vYdffr26Wd6f9uv4DDdz4nA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB6VggQcKLQgQqENEgcOpLW9jh9HhKhaUVYcFqm3yLHHEtIqW7q7lfj3eOJsSgU9cEoUjyXH47HH8_oA3jEvjKdsHJselTSBVS3WptJWixgZa22bwSb0dGouLuy3Lfgw5sIgYh98hkf02vvyw8KvyVR2zJWQaiLvwf1aSsFyttboM5A1z7XBeRLhdOsYCvlwZo9nZ7PsdzCatuNbZ1APqkIhkW6ZZiVmOIu_dub-uDnZ-b-BPoUng1pZfszr4BlsYbcLOxvIhnKQ4F14_Ef9wT2YdhUl_nY4L8nIu7j8VXnSFwk2AkO5CTasAo6bSzl3K4qXK697c3_5c51YM-RyPofvJ59nn06rAWCh8kmLWlW1c0E4ZoW3VgdsYytajkpp7VHVgby0NlrurQ-a8chNTB-jSioOJjUhxskL2O4WHb6EkkstMJjgpXMSYzSWkMaEMzH1SC0FHG2mvPFD9XH6m3nT30KYbRKPCBNTNZlHBbwfO1zmwht3k-4RC27I8uwXcHCLpzftWlujpSlgf8PkZpDcZUPFdqgiTV3A27E1iRz5UVyHi3UimRB-vJwoW8DhHTTCpMutVeLVv8d2CA9PZ1_Pm_Oz6Zd9eJTtOhRF-Rq2V1drfAMP_PXqx_LqoF_jvwEX3_vj |
| 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=n-channel+entropy-constrained+multiple-description+lattice+vector+quantization&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Ostergaard%2C+J&rft.au=Jensen%2C+J&rft.au=Heusdens%2C+R&rft.date=2006-05-01&rft.issn=0018-9448&rft.volume=52&rft.issue=5&rft_id=info:doi/10.1109%2FTIT.2006.872847&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |