1 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.SC2018
An efficient reduction strategy for signature-based algorithms to compute Groebner basis
Kosuke Sakata
This paper introduces a strategy for signature-based algorithms to compute Groebner basis. The signature-based algorithms generate S-pairs instead of S-polynomials, and use s-reduc…
cs.IT2014★ 1 cited
Spatially-Coupled Precoded Rateless Codes with Bounded Degree Achieve the Capacity of BEC under BP decoding
Kosuke Sakata, Kenta Kasai, Kohichi Sakaniwa
Raptor codes are known as precoded rateless codes that achieve the capacity of BEC. However the maximum degree of Raptor codes needs to be unbounded to achieve the capacity. In thi…
cs.IT2013★ 1 cited
Spatially-Coupled Precoded Rateless Codes
Kosuke Sakata, Kenta Kasai, Kohichi Sakaniwa
Raptor codes are rateless codes that achieve the capacity on the binary erasure channels. However the maximum degree of optimal output degree distribution is unbounded. This leads…