Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

McMaster University

$23,389.00

Network data compression: fundamental limits and practical schemes

FY 2008-09

Summary
Network data compression, also known as Slepian-Wolf coding, is a far-reaching generalization of Shannon's point-to-point lossless source coding to the distributed network scenario. However, the impact of the fundamental theory of Slepian-Wolf coding on practical network data compression techniques is still very limited. Most existing network data compression schemes are direct combinations of conventional point-to-point data compression methods, and cannot fully exploit the potential as promised by the theory of Slepian-Wolf coding. The proposed research is designed to enable Slepaian-Wolf coding theory to realize its potential as a theoretical foundation of network data compression. We shall explore the intimate connections between Slepian-Wolf coding and channel coding in terms of rate-error tradeoff and operational duality. The emphasis will be on obtaining guidelines for the design of practical network data compression schemes. We shall explore alternative formulations of distributed network data compression theory that incorporate variable-rate encoding, universal decoding, mismatched decoding, and asynchronous Slepian-Wolf coding. In addition to strengthening the theoretical foundation of network data compression, the proposed research will provide a systematic framework for practical Slepian-Wolf code construction that can meet the requirement of real world applications. The proposed research could find applications in many different areas. Besides its obvious usefulness in conventional networks, network data compression techniques can also be potentially used in video coding, secure fingerprint biometrics, secret key generation, data hiding and watermarking. The proposed research will be integrated with educational activities to attract talented students to work in this fertile interdisciplinary area and help them develop their engineering and mathematical skills in line with the needs of academia and Canadian information technology industries.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
355601-2008
Name nom
Chen, Jun
Department département
Electrical and Computer Engineering
Organization id
27
Institution établissement
McMaster University
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2008
Award amount
23389
Program id
RGPIN
Program nane en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
334
Committee name en
Commun.,Computers & Components
Committee name fr
Communic.,ordin. et composants
Area of application code
1207
Area of application group en
Advancement of knowledge
Area of application group fr
Avancement des connaissances
Area of application en
Information, computer and communication technologies
Area of application fr
Technologie de l'information, des ordinateurs et des réseaux de communications
Research subject code
2718
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Communication and information theory
Research subject fr
Théorie des télécommunications et de l'information
Partie
1
Nb partie
5
Application title
Network data compression: fundamental limits and practical schemes
Keyword
NA
Application summary
Network data compression, also known as Slepian-Wolf coding, is a far-reaching generalization of Shannon's point-to-point lossless source coding to the distributed network scenario. However, the impact of the fundamental theory of Slepian-Wolf coding on practical network data compression techniques is still very limited. Most existing network data compression schemes are direct combinations of conventional point-to-point data compression methods, and cannot fully exploit the potential as promised by the theory of Slepian-Wolf coding. The proposed research is designed to enable Slepaian-Wolf coding theory to realize its potential as a theoretical foundation of network data compression. We shall explore the intimate connections between Slepian-Wolf coding and channel coding in terms of rate-error tradeoff and operational duality. The emphasis will be on obtaining guidelines for the design of practical network data compression schemes. We shall explore alternative formulations of distributed network data compression theory that incorporate variable-rate encoding, universal decoding, mismatched decoding, and asynchronous Slepian-Wolf coding. In addition to strengthening the theoretical foundation of network data compression, the proposed research will provide a systematic framework for practical Slepian-Wolf code construction that can meet the requirement of real world applications. The proposed research could find applications in many different areas. Besides its obvious usefulness in conventional networks, network data compression techniques can also be potentially used in video coding, secure fingerprint biometrics, secret key generation, data hiding and watermarking. The proposed research will be integrated with educational activities to attract talented students to work in this fertile interdisciplinary area and help them develop their engineering and mathematical skills in line with the needs of academia and Canadian information technology industries.