A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes Export

@article{Koetter_AparallelImplementationOfBMforAG_1998, abstract = {We obtain a parallel Berlekamp-Massey-type algorithm for determining error locating functions for the class of one point algebraic-geometric codes. The proposed algorithm has a regular and simple structure and is suitable for VLSI implementation. We give an outline for an implementation, which uses as main blocks γ copies of a modified one-dimensional Berlekamp-Massey algorithm, where γ is the order of the first nongap in the function space associated with the code. Such a parallel implementation determines the error locator for an algebraic-geometric code using the same time requirements as the underlying one-dimensional Berlekamp-Massey algorithm applied to the decoding of Reed-Solomon codes}, author = {Koetter, R.}, citeulike-article-id = {1167737}, citeulike-linkout-0 = {http://dx.doi.org/10.1109/18.681314}, citeulike-linkout-1 = {http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=681314}, day = {06}, doi = {10.1109/18.681314}, journal = {Information Theory, IEEE Transactions on}, keywords = {algebraic-geometric, coding, list, rs}, month = {August}, number = {4}, pages = {1353--1368}, posted-at = {2009-10-21 08:01:36}, priority = {2}, title = {A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes}, url = {http://dx.doi.org/10.1109/18.681314}, volume = {44}, year = {2002} }

TY - JOUR ID - Koetter_AparallelImplementationOfBMforAG_1998 L3 - citeulike-article-id:1167737 N2 - We obtain a parallel Berlekamp-Massey-type algorithm for determining error locating functions for the class of one point algebraic-geometric codes. The proposed algorithm has a regular and simple structure and is suitable for VLSI implementation. We give an outline for an implementation, which uses as main blocks γ copies of a modified one-dimensional Berlekamp-Massey algorithm, where γ is the order of the first nongap in the function space associated with the code. Such a parallel implementation determines the error locator for an algebraic-geometric code using the same time requirements as the underlying one-dimensional Berlekamp-Massey algorithm applied to the decoding of Reed-Solomon codes IS - 4 JF - Information Theory, IEEE Transactions on EP - 1368 TI - A fast parallel implementation of a Berlekamp-Massey algorithm for algebraic-geometric codes VL - 44 SP - 1353 KW - algebraic-geometric KW - coding KW - list KW - rs AU - Koetter, R PY - 2002/08/06/ UR - http://dx.doi.org/10.1109/18.681314 ER -