Skip to content
/ CodingTheoryIntro Public

Scripts that compute instances of the Hamming Code and Reed-Solomon codes. Includes classes that represent finite fields, polynomials over finite fields, and matrices over finite fields.

0 stars 0 forks Branches Tags Activity
Star
Notifications

Joe-Ferrara/CodingTheoryIntro

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits

EuclideanAlgorithm.py

EuclideanAlgorithm.py

 
 

FpClass.py

FpClass.py

 
 

HammingCode.py

HammingCode.py

 
 

LinearCode.py

LinearCode.py

 
 

Matrices.py

Matrices.py

 
 

NumberType.py

NumberType.py

 
 

Polynomials.py

Polynomials.py

 
 

README.md

README.md

 
 

ReedSolomonCode.py

ReedSolomonCode.py

 
 

TaleOfTwoCities.txt

TaleOfTwoCities.txt

 
 

TaleOfTwoCitiesHammingTest.py

TaleOfTwoCitiesHammingTest.py

 
 

TaleOfTwoCitiesRSTest.py

TaleOfTwoCitiesRSTest.py

 
 

TestPolynomialDivision.py

TestPolynomialDivision.py

 
 

TestingPolynomials.py

TestingPolynomials.py

 
 

testRowEchelonForm.py

testRowEchelonForm.py

 
 

testingFpClass.py

testingFpClass.py

 
 

testingMatrices.py

testingMatrices.py

 
 

Repository files navigation

About

Scripts that compute instances of the Hamming Code and Reed-Solomon codes. Includes classes that represent finite fields, polynomials over finite fields, and matrices over finite fields.

Topics

polynomials matrices finite-fields coding-theory hamming-code reed-solomon-codes

Resources

Readme
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Languages