A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network coding

Koki Kazama; Akira Kamatsuka; Toshiyasu Matsushima

A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network coding

Koki Kazama, Akira Kamatsuka, Toshiyasu Matsushima

School of Fundamental Science and Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

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.

Original language	English
Title of host publication	Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	666-670
Number of pages	5
ISBN (Electronic)	9784885523090
Publication status	Published - 2017 Feb 2
Event	3rd International Symposium on Information Theory and Its Applications, ISITA 2016 - Monterey, United States Duration: 2016 Oct 30 → 2016 Nov 2

Other

Other	3rd International Symposium on Information Theory and Its Applications, ISITA 2016
Country/Territory	United States
City	Monterey
Period	16/10/30 → 16/11/2

ASJC Scopus subject areas

Computer Networks and Communications
Hardware and Architecture
Information Systems
Signal Processing
Library and Information Sciences

Cite this

A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network coding. / Kazama, Koki; Kamatsuka, Akira; Matsushima, Toshiyasu.
Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016. Institute of Electrical and Electronics Engineers Inc., 2017. p. 666-670 7840508.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Kazama, K, Kamatsuka, A & Matsushima, T 2017, A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network coding. in Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016., 7840508, Institute of Electrical and Electronics Engineers Inc., pp. 666-670, 3rd International Symposium on Information Theory and Its Applications, ISITA 2016, Monterey, United States, 16/10/30.

@inproceedings{b06b9f599eff45e98e1880a516e76d95,

title = "A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network coding",

abstract = "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.",

author = "Koki Kazama and Akira Kamatsuka and Toshiyasu Matsushima",

year = "2017",

month = feb,

day = "2",

language = "English",

pages = "666--670",

booktitle = "Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

note = "3rd International Symposium on Information Theory and Its Applications, ISITA 2016 ; Conference date: 30-10-2016 Through 02-11-2016",

}

TY - GEN

T1 - A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network coding

AU - Kazama, Koki

AU - Kamatsuka, Akira

AU - Matsushima, Toshiyasu

PY - 2017/2/2

Y1 - 2017/2/2

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85015165638&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85015165638&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:85015165638

SP - 666

EP - 670

BT - Proceedings of 2016 International Symposium on Information Theory and Its Applications, ISITA 2016

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 3rd International Symposium on Information Theory and Its Applications, ISITA 2016

Y2 - 30 October 2016 through 2 November 2016

ER -

A maximum likelihood decoding algorithm of Gabidulin codes in deterministic network coding

Abstract

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this