Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

多レベル不均一誤り訂正符号の線形計画限界

友彦 齋藤, Tomohiko Saito

Published Mar 31, 2019• 0 citations
OpenAlex

Abstract

In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds.

Related papers

Linear Programming Bounds for Multi-level Unequal Protection Codes

Tomohiko Saito, Toshiyasu Matsushima, Shigeichi Hirasawa

In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Oct 1, 2018•1 citation

Linear programming bounds for multi-level unequal protection codes

Tomohiko SAITO

符号長n と最小距離d の誤り訂正符号に対し，符号語数の上界として，ハミング限界や線形計画(Linear Programming: LP) 限界が知られている．一方，Masnick らによって不均一誤り訂正(Unequal Error Protection: UEP) 符号が提案された．UEP 符号においても，符号語数の上界として，ハミング限界を拡張した修正ハミング限界が示されている．従来，著者らはUEP 符号のサブクラスとして2-レベルUEP符号を定義し，そのLP 限界を示した．本論文では，2-レベルUEP 符号を拡張した，多レベルUEP 符号を定義し，そのLP 限界を導出する．更に，多レベルUEP 符号のLP 限界が修正ハミング限界よりも優れていることを示す．

•Mar 31, 2019•0 citations

New results on self-orthogonal unequal error protection codes

Zhi Chen, Pingzhi Fan, Fan Jin

A lower bound on the length of binary self-orthogonal unequal error protection (UEP) codes is derived, and two design procedures for constructing optimal self-orthogonal UEP codes are proposed. With this lower bound, known self-orthogonal UEP codes can be evaluated. It is pointed out that, for given values of minimum distance and code rate, the self-orthogonal codes must be relatively long, so optimal self-orthogonal codes are not optimal in general. But self-orthogonal codes can be implemented simply, and they have error-correcting capabilities beyond those guaranteed by their minimum distance. These properties can be viewed as a partial compensation for using self-orthogonal codes.>

IEEE Transactions on Information Theory•Jan 1, 1990•9 citations

On decoding unequal error protection product codes

P.C. Stevens

The decoding of unequal error protection product codes, which are a combination of linear unequal error protection (UEP) codes and product codes, is addressed. A nonconstructive proof of the existence of a good error-erasure-decoding algorithm is presented; however, obtaining the decoding procedure is still an open research problem. A particular subclass of UEP product codes is considered, including a decoding algorithm that is an extension of the Blokh-Zyablov decoding algorithm for product codes. For this particular subclass the decoding problem is solved.>

IEEE Transactions on Information Theory•Jul 1, 1990•3 citations

Multi-Edge type Unequal Error Protection LDPC codes

H. V. Beltrao Neto, Werner Henkel, Valdemar C. da Rocha

Irregular low-density parity check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes. However, this UEP capability is strongly dependent on the connection profile among the protection classes. This paper applies a multi-edge type analysis of LDPC codes for optimizing such connection profile according to the performance requirements of each protection class. This allows the construction of UEP-LDPC codes where the difference between the performance of the protection classes can be adjusted and with an UEP capability that does not vanish as the number of decoding iterations grows.

arXiv:1101.5985•Jan 31, 2011•2 citations

UEP non-binary LDPC codes: A promising framework based on group codes

Alban Goupil, David Declercq

In this paper, we address the problem of providing unequal error protection (UEP) with LDPC codes built on finite sets of order strictly greater than 2 (nonbinary codes). The main interest of providing UEP with nonbinary LDPC codes is that future standards are likely to prefer nonbinary coding schemes because of their better robustness to the codeword length and the modulation size. However, the problem of giving UEP properties with nonbinary LDPC codes is much more difficult than with binary LDPC codes. We present a first attempt to solve this difficult problem, based on LDPC codes built on finite groups. The framework and the basis about group LDPC codes are first presented in details, and the framework is used to give examples of UEP nonbinary LDPC codes that actually achieve different UEP properties at the bit level while the symbol error properties are kept equally protected.

IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2008•1 citation
In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds.
In coding theory, it is important to find upper bounds for the code size given a code length and minimum distance. The Hamming bounds and Linear Programming (LP) bounds were proposed in previous works. On the other hand, Masnick et al. proposed Unequal Error Protection (UEP) codes and modified Hamming bounds as upper bounds for the code size of UEP codes. In our previous work, we defined 2-level UEP codes as a subclass of UEP codes, and derived LP bounds for 2-level UEP codes. In this paper, we define multi-level UEP codes by extending 2-level UEP codes, and derive LP bounds for multi-level UEP codes. Moreover, we show that LP bounds for UEP codes are tighter upper bound than modified Hamming bounds.
符号長n と最小距離d の誤り訂正符号に対し，符号語数の上界として，ハミング限界や線形計画(Linear Programming: LP) 限界が知られている．一方，Masnick らによって不均一誤り訂正(Unequal Error Protection: UEP) 符号が提案された．UEP 符号においても，符号語数の上界として，ハミング限界を拡張した修正ハミング限界が示されている．従来，著者らはUEP 符号のサブクラスとして2-レベルUEP符号を定義し，そのLP 限界を示した．本論文では，2-レベルUEP 符号を拡張した，多レベルUEP 符号を定義し，そのLP 限界を導出する．更に，多レベルUEP 符号のLP 限界が修正ハミング限界よりも優れていることを示す．
A lower bound on the length of binary self-orthogonal unequal error protection (UEP) codes is derived, and two design procedures for constructing optimal self-orthogonal UEP codes are proposed. With this lower bound, known self-orthogonal UEP codes can be evaluated. It is pointed out that, for given values of minimum distance and code rate, the self-orthogonal codes must be relatively long, so optimal self-orthogonal codes are not optimal in general. But self-orthogonal codes can be implemented simply, and they have error-correcting capabilities beyond those guaranteed by their minimum distance. These properties can be viewed as a partial compensation for using self-orthogonal codes.>
The decoding of unequal error protection product codes, which are a combination of linear unequal error protection (UEP) codes and product codes, is addressed. A nonconstructive proof of the existence of a good error-erasure-decoding algorithm is presented; however, obtaining the decoding procedure is still an open research problem. A particular subclass of UEP product codes is considered, including a decoding algorithm that is an extension of the Blokh-Zyablov decoding algorithm for product codes. For this particular subclass the decoding problem is solved.>
Irregular low-density parity check (LDPC) codes are particularly well-suited for transmission schemes that require unequal error protection (UEP) of the transmitted data due to the different connection degrees of its variable nodes. However, this UEP capability is strongly dependent on the connection profile among the protection classes. This paper applies a multi-edge type analysis of LDPC codes for optimizing such connection profile according to the performance requirements of each protection class. This allows the construction of UEP-LDPC codes where the difference between the performance of the protection classes can be adjusted and with an UEP capability that does not vanish as the number of decoding iterations grows.
In this paper, we address the problem of providing unequal error protection (UEP) with LDPC codes built on finite sets of order strictly greater than 2 (nonbinary codes). The main interest of providing UEP with nonbinary LDPC codes is that future standards are likely to prefer nonbinary coding schemes because of their better robustness to the codeword length and the modulation size. However, the problem of giving UEP properties with nonbinary LDPC codes is much more difficult than with binary LDPC codes. We present a first attempt to solve this difficult problem, based on LDPC codes built on finite groups. The framework and the basis about group LDPC codes are first presented in details, and the framework is used to give examples of UEP nonbinary LDPC codes that actually achieve different UEP properties at the bit level while the symbol error properties are kept equally protected.