Ticket #11413 (needs_review enhancement)
Decoding general linear codes with Groebner bases
|Reported by:||Niels||Owned by:||T.b.a.|
|Component:||coding theory||Keywords:||general decoding groebner basis|
|Cc:||sbulygin, klee||Work issues:|
|Report Upstream:||N/A||Reviewers:||Burcin Erocal|
|Authors:||Niels Duif||Merged in:|
Description (last modified by Niels) (diff)
I have implemented a decoding method for general linear codes in Sage. The method decodes up to half the true minimum distance using Groebner bases. This method was introduced by Bulygin and Pellikaan.
I was expecting the method to be faster than syndrome decoding, but it appears to be equally fast. It may be worth having this method around in Sage since Groebner basis computation may become faster. I have attached a report with my findings.
- Cc sbulygin added; Stanislav.Bulygin@… removed
- Reviewers set to Burcin Erocal
- Status changed from needs_review to needs_work