Skip to content

Latest commit

 

History

8 Commits

Folders and files

NameName
Last commit message
Last commit date
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

thesis-tempname

An ISD improvement for LDPC codes

The repo follows the following structure:

  • H-generation: contains scripts for structured parity check matrix generation
  • costs: contains scripts for computational complexity estimation of involved algorithms
  • isds: contians different isd implementations in both python (and C in the near future)
  • tex: contains the actual graduation thesis material (trying to understand how to link it via overleaf)
  • references: contains some downloaded papers I have read regarding ISD and codes

H-generation

  • neal: fixed column weight ldpc generation as in this reference
  • populate_columns: initial idea for fixed column weight H generation
  • populate_both: initial idea for fixed column and row weight H generation

Isds

Some comments on the files contained in isds directory:

  • isd: contains first stern and lee and brickell implementation (finds all codewords)
  • pge: code for PGE execution
  • sparsestern: contains first sparsestern implementation (finds all codewords)
  • decisional_sparsestern1: sparsestern implementation that stops when a codeword is found (mutated from sparsestern)
  • decisional_sparsestern2: sparsestern implementation that doesn't use total list enumeration for MITM (mutated from above version)
  • decisional_sparsestern3: sparsestern implementation that doesn't shift A matrix right (mutated from above version)
  • milp_sparsestern: sparsestern implementation that uses a solver (SCIP) to get optimal z (mutuated from sparsestern)
  • decisional_stern: newest stern implementation (mutated from decisional_sparsestern3)

Costs

Some comments on the files contained in isds directory:

  • costs_idea: algorithm cost comparison for fixed column weight
  • min_distance: comparison of minimum distances considering different ns and rates
  • Stern_small_subcodes_setting: sparse stern and stern algorithm cost comparison and parameter estimaiton
  • Stern_small_subcodes_setting_approx: just as above, but with ammortized lists and approximied binomials

Tex

Contains current thesis progress, thus it's mainly latex files. Only updated from time to time. I'm planning on building my own class. Still making my mind up about it.

References

Currently contained references:

About

An ISD improvement for LDPC codes

Resources

Stars

0 stars

Watchers

1 watching

Forks

Releases

Packages

Contributors

Languages