On symmetric multiple description coding

We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the Hamming distortion measure, this lower bound can be evaluated with the aid of a certain minimax theorem. A similar minimax theore...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2013 IEEE Information Theory Workshop (ITW) S. 1 - 5
Hauptverfasser: Lin Song, Shuo Shao, Jun Chen
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.09.2013
Schlagworte:
ISBN:9781479913213, 1479913219
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the Hamming distortion measure, this lower bound can be evaluated with the aid of a certain minimax theorem. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.
AbstractList We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform source with the Hamming distortion measure, this lower bound can be evaluated with the aid of a certain minimax theorem. A similar minimax theorem is established in the quadratic Gaussian setting, which is further leveraged to analyze the special case where the minimum sum rate subject to two levels of distortion constraints (with the second level imposed on the complete set of descriptions) is attained; in particular, we determine the minimum achievable distortions at the intermediate levels.
Author Lin Song
Shuo Shao
Jun Chen
Author_xml – sequence: 1
  surname: Lin Song
  fullname: Lin Song
  organization: Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, ON, Canada
– sequence: 2
  surname: Shuo Shao
  fullname: Shuo Shao
  organization: Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, ON, Canada
– sequence: 3
  surname: Jun Chen
  fullname: Jun Chen
  organization: Dept. of Electr. & Comput. Eng., McMaster Univ., Hamilton, ON, Canada
BookMark eNo1j79Lw0AYQE_UwdbugktGl8T77nq_RilaC4UuAcdyP75PDpJLSOLQ_97BOj3e8uCt2F0ZCjL2BLwB4O710H41goNstHYgwNywFWyNcyCFVLds44z9d5AP7OVUqvnS97hMOVb9T7fkscMq4RynPC55KFUcUi7fj-yefDfj5so1az_e291nfTztD7u3Y50dX-pE1ntL2stgld6qwJNDEkgqBQWGtCGLURNFT8E7jiJFqYSJSZmAFOSaPf9lMyKexyn3frqcry_yF8k0Qe4
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ITW.2013.6691217
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
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
EISBN 1479913235
9781479913237
EndPage 5
ExternalDocumentID 6691217
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i90t-df8aa8f6a3b85645b0d9ef2ef5db517f67f8ec6ffcafba90e2dc3527cd57befb3
IEDL.DBID RIE
ISBN 9781479913213
1479913219
IngestDate Wed Jun 26 19:28:21 EDT 2024
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i90t-df8aa8f6a3b85645b0d9ef2ef5db517f67f8ec6ffcafba90e2dc3527cd57befb3
PageCount 5
ParticipantIDs ieee_primary_6691217
PublicationCentury 2000
PublicationDate 2013-Sept.
PublicationDateYYYYMMDD 2013-09-01
PublicationDate_xml – month: 09
  year: 2013
  text: 2013-Sept.
PublicationDecade 2010
PublicationTitle 2013 IEEE Information Theory Workshop (ITW)
PublicationTitleAbbrev ITW
PublicationYear 2013
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.521875
Snippet We derive a single-letter lower bound on the minimum sum rate of multiple description coding with symmetric distortion constraints. For the binary uniform...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Distortion measurement
Encoding
Joints
Markov processes
Tin
Vectors
Zinc
Title On symmetric multiple description coding
URI https://ieeexplore.ieee.org/document/6691217
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwMhEJ20jQdPalrjd_bgwYPbbpcuA2djo5faQxN7a2AYkh66Nf0w8d8L67Zq4sUbEEKYEJgHvJkHcGvIBhAc5dtzL9IBDUyqhHRp3mcdFUYwJ1uJTeBopKZTPW7A_T4Whpkr8hl3Y7H6y3dL2sansp6Uuh8gdBOaiPJHrBYGkCPC1tulcKrrYvctmene8-Q18rhEtx7jl5hK5UuGR_-bxTF0voPykvHe3ZxAg8s23L2UyfpjsYi6WJTs2IGJ4_1pkNAy9u_AZPg4eXhKa_GDdK6zTeq8MkZ5aYRVMeGLzZxmn7MvnC366CV6xSS9J-Ot0RnnjgKWQnIFWvZWnEKrXJZ8BgmFKxASCkNODASyZieVkmhk8ExeiHNoRyNnb1_pLWa1fRd_N1_CYV4pQkSa1RW0NqstX8MBvW_m69VNtSafYnmMFw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFfSk0opv9-DBg9tuk908zmJpsdYeFuyt5DGBHrqVPgT_vcm6rQpevCUhhAwhmS_JN_MB3CqjPQgO8u3E0Tg1qYoFZTYmHZRBYYQTo0uxCT4civFYjmpwv42FQcSSfIatUCz_8u3crMNTWZsx2fEQegd2szQlyY9oLe5hDvWbb5PEqarTzcdkItv9_DUwuWirGuWXnErpTbqH_5vHETS_w_Ki0dbhHEMNiwbcvRTR8mM2C8pYJtrwAyOL2_MgMvPQvwl59zF_6MWV_EE8lckqtk4oJRxTVIuQ8kUnVqIj6DKrsw53jDuBhjlnlNNKJkis8WiKG5txjU7TE6gX8wJPITL-EsQNp8pYmlKOEi0TgnHFvG9ylJ5BIxg5eftKcDGp7Dv_u_kG9nv582Ay6A-fLuCAlPoQgXR1CfXVYo1XsGfeV9Pl4rpcn0_gEo9e
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=2013+IEEE+Information+Theory+Workshop+%28ITW%29&rft.atitle=On+symmetric+multiple+description+coding&rft.au=Lin+Song&rft.au=Shuo+Shao&rft.au=Jun+Chen&rft.date=2013-09-01&rft.pub=IEEE&rft.isbn=9781479913213&rft.spage=1&rft.epage=5&rft_id=info:doi/10.1109%2FITW.2013.6691217&rft.externalDocID=6691217
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781479913213/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781479913213/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781479913213/sc.gif&client=summon&freeimage=true