Print edition: ISSN 0913-5685 Online edition: ISSN 2432-6380
[TOP] | [2010] | [2011] | [2012] | [2013] | [2014] | [2015] | [2016] | [Japanese] / [English]
IT2013-32
Upper Bounds on the Average Probability of Undetected Error for the Ensembles of both Product and Concatenated Codes
Toshihisa Nishijima (Hosei Univ.), Kin-ichiroh Tokiwa (Osaka Sangyo Univ.)
pp. 1 - 6
IT2013-33
A Soft-Decision Sphere Decoding Based on a Recursive Vector Generator Using Euclidian Distance
Takuya Kusaka (Okayama Univ.), Toru Fujiwara (Osaka Univ.), Ryuhei Yokoyama (Okayama Univ.)
pp. 7 - 11
IT2013-34
Iterative Multiuser Joint Decoding based on Augmented Lagrangian Method
Shunsuke Horii, Tota Suko, Toshiyasu Matsushima, Shigeichi Hirasawa (Waseda Univ.)
pp. 13 - 17
IT2013-35
Performance Analysis on Invertible Bloom Lookup Tables with Erasure Errors
Daichi Yugawa, Tadashi Wadayama (Nagoya Inst. of Tech.)
pp. 19 - 24
IT2013-36
Spatially Coupled Code Suitable for Parallel Decoding with Forked Protograph
Akio Otsuki, Tadashi Wadayama (Nagoya Inst. of Tech.)
pp. 25 - 30
IT2013-37
Fountain Codes Based on Triangular Coding
Takayuki Nozaki (Kanagawa Univ.)
pp. 31 - 36
IT2013-38
[Invited Talk]
Memory and Constrained Coding
Hiroshi Kamabe (Gifu Univ.)
pp. 37 - 42
IT2013-39
Finite Type Constrained Systems for Flash Memories
Akiko Manada (Univ. of Electro-Comm.)
pp. 43 - 48
IT2013-40
Number of operations of parallel decoder for q-ary Hamming codes
Reiya Ooshima, Ken-ichi Iwata (Univ. of Fukui)
pp. 49 - 54
Note: Each article is a technical report without peer review, and its polished version will be published elsewhere.