http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Zumbragel, Jens (검색결과 2 건)
- 무료
- 기관 내 무료
- 유료
-
NEW RESULTS ON THE PSEUDOREDUNDANCY
Greferath, Marcus,Liu, Zihui,Wu, Xin-Wen,Zumbragel, Jens Korean Mathematical Society 2019 대한수학회보 Vol.56 No.1
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.
-
New results on the pseudoredundancy
Marcus Greferath,Zihui Liu,Xin-Wen Wu,Jens Zumbragel 대한수학회 2019 대한수학회보 Vol.56 No.1
The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kl\o ve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of $k$-dimensional binary codes and compute their exact pseudocodeword redundancy.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
