Name
Abstract | ||
|---|---|---|
This paper proposes a joint coding with three functions: source coding, channel coding, and public-key encryption. A codeword is simply generated as a product of an encoding matrix and a sparse information word. This encoding method has much lower encoding complexity than the conventional coding techniques in which source coding, encryption, and channel coding are successively applied to an information word. The encoding matrix is generated by using two linear error control codes and randomly generated nonsingular matrices. Encryption is based on the intractableness of factorizing a matrix into randomly constructed factor matrices, and of decoding an error control code defined by a random parity-check matrix. Evaluation shows that the proposed joint coding gives a lower bit error rate and a superior compression ratio than the conventional codings. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-77224-8_20 | AAECC |
Keywords | Field | DocType |
conventional coding technique,linear block code,proposed joint coding,factor matrix,nonsingular matrix,encoding complexity,joint coding,encoding matrix,channel coding,encoding method,joint source-cryptographic-channel,source coding,public key encryption,compression ratio,bit error rate,source code,block codes | Discrete mathematics,Tunstall coding,Coding gain,Entropy encoding,Parity-check matrix,Algorithm,Theoretical computer science,Shannon–Fano coding,Mathematics,Arithmetic coding,Variable-length code,Context-adaptive binary arithmetic coding | Conference |
Volume | ISSN | ISBN |
4851 | 0302-9743 | 3-540-77223-5 |
Citations | PageRank | References |
2 | 0.42 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haruhiko Kaneko | 1 | 31 | 12.58 |
| Eiji Fujiwara | 2 | 180 | 31.14 |