Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes

DOI10.1007/978-3-540-77224-8_20MaRDI QIDQ5386090zbMATH OpenOpenAlexFDO

Authors Haruhiko Kaneko, Eiji Fujiwara

Publication date 17 April 2008

Published in Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77224-8_20

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Cryptography (94A60) Source coding (94A29)

Recommendations

• On joint coding for watermarking and encryption
• Joint source/channel coding for variable length codes
• Distributed source coding using chaos-based cryptosystem
• Joint compression and encryption using chaotically mutated Huffman trees
• scientific article; zbMATH DE number 2036478

Cites work

• scientific article; zbMATH DE number 3989251 (Why is no real title available?)
• A Method for the Construction of Minimum-Redundancy Codes
• A universal algorithm for sequential data compression
• Code Design for Dependable Systems
• Design of capacity-approaching irregular low-density parity-check codes
• Good error-correcting codes based on very sparse matrices
• LDGM codes for channel coding and joint source-channel coding of correlated sources
• On the equivalence of McEliece's and Niederreiter's public-key cryptosystems

Cited in

(1)

• Distributed source coding using chaos-based cryptosystem

This page was built for publication: Joint Source-Cryptographic-Channel Coding Based on Linear Block Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386090)