里德-所罗门解码
我有一个 28 字节的序列，据说是用 Reed-Solomon (28, 24, 5) 代码编码的。 RS码使用8位符号并在GF(28)中运行。场发生器多项式为 x8+x4+x3+x2+1。我正在寻找一种简单的方法来解码该序列，以便我可以判断该序列是否有错误。
我尝试过 Python ReedSolomon 模块，但我什至不确定如何正确配置编解码器我的 RS 代码（例如，场生成多项式的第一个连续根是什么，什么是原始元素）。我还查看了 Schifra，但我什至无法在我的 Mac 上编译它。
我不太关心平台（例如Python、C、Scilab）只要它是免费的即可。
I've got a sequence of 28 bytes, which are supposedly encoded with a Reed-Solomon (28, 24, 5) code. The RS code uses 8-bit symbols and operates in GF(28). The field generator polynomial is x8+x4+x3+x2+1. I'm looking for a simple way to decode this sequence, so I can tell if this sequence has errors.
I've tried the Python ReedSolomon module, but I'm not even sure how to configure the codec properly for my RS code (e.g. what's the first consecutive root of the field generator polynomial, what's the primitive element). I also had a look at Schifra, but I couldn't even compile it on my Mac.
I don't care too much about the platform (e.g. Python, C, Scilab) as long as it is free.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
几年前，我成功构建了一个使用 Reed Solomon 纠错的嵌入式数据通信项目。我只是看了一下它来刷新我的记忆，我发现我使用了一个相当轻量级的、GPL 许可的 C 语言子系统，由一位名叫 Phil Karn 的知名人士发布，来进行编码和解码。虽然只有几百行代码，但内容却相当丰富。然而我发现我不需要理解数学就可以使用代码。
谷歌搜索 Phil Karn Reed Solomon 找到了我这个文档。
这看起来是一个不错的起点。希望这有帮助。
I successfully built an embedded data comms project that used Reed Solomon error correction a few years ago. I just had a look at it to refresh my memory, and I found that I used a fairly lightweight, GPL licenced, C language subsystem published by a well known guy named Phil Karn to do the encoding and decoding. It's only a few hundred lines of code, but it's pretty intense stuff. However I found I didn't need to understand the math to use the code.
Googling Phil Karn Reed Solomon got me this document.
Which looks like a decent place to start. Hope this helps.