Concatenated Multilevel Coded Modulation Schemes for Digital Satellite Broadcasting

The error performance of bandwith-efficient concatenated multilevel coded modulation (MCM) schemes for digital satellite broadcasting is analyzed. Nonstandard partitioning, multistage decoding, and outer Reed-Solomon (RS) codes are employed to provided unequal error protection capabilities

A Secure Traitor Tracing Scheme against Key Exposure

Copyright protection is a major issue in distributing digital content. On the other hand, improvements to usability are sought by content users. In this paper, we propose a secure {\it traitor tracing scheme against key exposure (TTaKE)} which contains the properties of both a traitor tracing scheme and a forward secure public key cryptosystem. Its structure fits current digital broadcasting systems and it may be useful in preventing traitors from making illegal decoders and in minimizing the damage from accidental key exposure. It can improve usability through these properties.Comment: 5 pages, IEEE International Symposium on Information Theory 2005 (ISIT 2005

Binary Multilevel Convolutional Codes with Unequal Error Protection Capabilities

Binary multilevel convolutional codes (CCs) with unequal error protection (UEP) capabilities are studied. These codes belong to the class of generalized concatenated (GC) codes. Binary CCs are used as outer codes. Binary linear block codes of short length, and selected subcodes in their two-way subcode partition chain, are used as inner codes. Multistage decodings are presented that use Viterbi decoders operating on trellises with similar structure to that of the constituent binary CCs. Simulation results of example binary two-level CC\u27s are also reported

Quantum Error Correction beyond the Bounded Distance Decoding Limit

In this paper, we consider quantum error correction over depolarizing channels with non-binary low-density parity-check codes defined over Galois field of size $2^p$ . The proposed quantum error correcting codes are based on the binary quasi-cyclic CSS (Calderbank, Shor and Steane) codes. The resulting quantum codes outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder. By increasing the size of the underlying Galois field, i.e., $2^p$, the error floors are considerably improved.Comment: To appear in IEEE Transactions on Information Theor