- [Home]
- [Research achievement]
- [Research achievement detail]
Title | A Maximum Likelihood Decoding Algorithm of Gabidulin Codes in Deterministic Network Coding (in Japanese) |
---|---|
Authors | Koki Kazama 、Akira Kamatsuka 、Toshiyasu Matsushima |
Released Year | 2016 |
Format | International Conference |
Category | Channel coding |
Jounal Name | Proceedings of the 2016 International Symposium on Information Theory and Its Applications |
Jounal Page | pp.702-706 |
Published Year | 2016 |
Published Month | 10 |
Abstract (English) |
Recently, studies of linear network coding have attracted attention. This paper considers a probabilistic error model for the deterministic linear network coding. In the previous studies of error-correcting codes, Kaneko et al. proposed a decoding algorithms for probabilistic error model. This is a maximum likelihood decoding algorithm that uses the optimization method called branch and bound method. This paper constructs a new model of deterministic linear network coding and proposes a maximum likelihood decoding algorithm that uses the branch and bound method. |
Note (English) |
1 |
Manuscript | |
Presentation |