On the key equation over a commutative ring

We define alternant codes over a commutative ring R and a corresponding key equation. We show that when the ring is a domain, e.g. the p-adic integers, the error–locator polynomial is the unique monic minimal polynomial (shortest linear recurrence) of the syndrome sequence and that it can be obtaine...

Full description

Saved in:
Bibliographic Details
Main Authors: G.H. Norton, Ana Salagean
Format: Default Article
Published: 2000
Subjects:
Theory of computation not elsewhere classified
Other information and computing sciences not elsewhere classified
Alternant code
Decoding algorithm
Domain
Local ring
Minimal polynomial
Computation Theory and Mathematics
Information and Computing Sciences not elsewhere classified
Online Access:https://hdl.handle.net/2134/2327
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/2327

Similar Items