z-logo
open-access-imgOpen Access
Performance bounds for joint source-channel coding of uniform memoryless sources using a binary decomposition
Author(s) -
Seyed Bahram Zahir Azami,
Olivier Rioul,
Pierre Duhamel
Publication year - 1997
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - binary number , channel code , computer science , joint (building) , coding (social sciences) , variable length code , decomposition , decoding methods , algorithm , shannon–fano coding , channel (broadcasting) , theoretical computer science , mathematics , arithmetic , telecommunications , statistics , engineering , biology , architectural engineering , ecology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom