Computer Searches for Twisted Reed-Solomon Codes

This is a publically available repository of an implementation which is connected with the following publication:

Twisted Reed-Solomon Codes

by Peter Beelen, Sven Puchinger, Johan Rosenkilde

Submitted to International Symposium in Information Theory

The code is written by Johan Rosenkilde.

The code is documented in a self-contained fashion, but it should be understandable for someone with the article at hand.

The code is written in Sage, and will require this to run. The source file(s) mention the latest version of Sage for which I have verified they work.

Some of the code here is structured into .sheet-files. They are clear-text analogues of the Sage Notebook's worksheets. Such a file is not meant to be imported as a whole, but rather evaluated block by block in a Sage process. In a sheet file, the blocks are delimited by lines starting with ###, usually followed by a one-line description of their contents. Possibly, the file is further sub-structured by visibly larger whitespace. Usually, the first few blocks will contain definitions, implementing the algorithms and helper functions. The latter blocks then set up examples and objects for input in the algorithms.

The latter blocks of the sheet might also contain code for creating plots or running the simulations included in the paper.

If you are using Emacs, then working with .sheet-files can be conveniently accomplished using [sage-sheel-mode] and activating its "block" functionality.

This code is released under the GPL v3 or later to conform with Sage's licensing.

You are welcome to contact me for questions on the implementation or its usage, or, of course, a discussion of the paper.

Johan Rosenkilde