Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Shojiro Sakata"'
Autor:
Masaya Fujisawa, Shojiro Sakata
Publikováno v:
IEEE Transactions on Information Theory. 64:4452-4466
The multipoint codes from algebraic curves are a broad class of algebraic geometry codes derived from algebraic functions, which have multiple poles/zeros on their defining curves. Each of them is defined as either a primal code or a dual code. The d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f78fea6c9e37e123fe4caf143e923148
https://doi.org/10.1109/tit.2018.2807478
https://doi.org/10.1109/tit.2018.2807478
Autor:
Shojiro Sakata, Masaya Fujisawa
Publikováno v:
IEEE Transactions on Information Theory. 60:2054-2064
Multipoint codes are a broad class of algebraic geometry codes derived from algebraic functions, which have multiple poles and/or zeros on an algebraic curve. Thus, they are more general than one-point codes, which are an important class of algebraic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::091fd49bd444d6b2e77704042157918a
https://doi.org/10.1109/tit.2014.2300473
https://doi.org/10.1109/tit.2014.2300473
Autor:
Masaya Fujisawa, Shojiro Sakata
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :857-862
It is a well-known fact [7], [9] that the BMS algorithm with majority voting can decode up to half the Feng-Rao designed distance dFR. Since dFR is not smaller than the Goppa designed distance dG, that algorithm can correct up to $\lfloor \frac{d_G-1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::40553aaee5235c7258fc569e972ae7df
https://doi.org/10.1587/transfun.e93.a.857
https://doi.org/10.1587/transfun.e93.a.857
Autor:
Masaya Fujisawa, Shojiro Sakata
Publikováno v:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. :1055-1061
In this paper we propose a method of constructing quasi-cyclic regular LDPC codes from a cyclic difference family, which is a kind of combinatorial design. The resulting codes have no 4-cycle, i.e. cycles of length four and are defined by a small set
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fec36950cdadc518cfbe94a952a037a1
https://doi.org/10.1093/ietfec/e90-a.5.1055
https://doi.org/10.1093/ietfec/e90-a.5.1055
Publikováno v:
IEEE Transactions on Information Theory. 51:3856-3871
We construct a two-dimensional systolic array implementing the Berlekamp-Massey-Sakata (BMS) algorithm to provide error-locator polynomials for codes on selected algebraic curves. This array is constructed by introducing some new polynomials in order
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::314c7a046289146d63bf1facc032dd1b
https://doi.org/10.1109/tit.2005.856950
https://doi.org/10.1109/tit.2005.856950
Publikováno v:
IEEE Transactions on Information Theory. 44:1558-1564
This article gives an errata (that is erasure- and error-) decoding algorithm of one-point algebraic-geometry codes up to the Feng-Rao (1994) designed minimum distance using Sakata's (see Proc. 1995 IEEE Int. Symp. Information Theory, Whistler, BC, C
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::07a6e03b409bc43c24e7a3931d2df3cf
https://doi.org/10.1109/18.681332
https://doi.org/10.1109/18.681332
Publikováno v:
IEEE Transactions on Information Theory. 41:1672-1677
We present a decoding algorithm for algebraic-geometric codes from regular plane curves, in particular the Hermitian curve, which corrects all error patterns of weight less than d*/2 with low complexity. The algorithm is based on the majority scheme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d65dcbe2c643f2142dbae7b1c4881d32
https://doi.org/10.1109/18.476240
https://doi.org/10.1109/18.476240
Publikováno v:
IEEE Transactions on Information Theory. 41:1762-1768
Summary form only given, as follows. Efficient decoding of BCH- and Reed-Solomon codes can be done using the Berlekanp-Massey (1969) algorithm, and it is natural to try to use the extension of this to N dimensions of Sakata (see Inform. Computat., vo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4a785c7c5f128b8f47cebaf6bc9db25d
https://doi.org/10.1109/18.476248
https://doi.org/10.1109/18.476248
Publikováno v:
Finite Fields and Their Applications. 1:83-101
We present a fast version of the Feng-Rao algorithm for decoding of one-point algebraic-geometric (AG) codes derived from the curves which Miura and Kamiya classified as Cab. Our algorithm performs the Feng-Rao algorithm efficiently by using the Saka
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5e230b74b814a7239259b94909a0cf00
https://doi.org/10.1006/ffta.1995.1006
https://doi.org/10.1006/ffta.1995.1006