Cyclic Codes of n < 26 and Comparison

The attached links are the group project paper and appendix in Cryptography course offered by Tommy Occhipinti in Carleton, Spring 2015: Crypt,Appendix.

The paper contains generating cyclic codes of length n < 26, comparing their parameters, and sorting out better ones.

Advertisements
Cyclic Codes of n < 26 and Comparison

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s