Skip to content
BranchesTags

Latest commit

 

History

3 Commits

Folders and files

NameName
Last commit message
Last commit date
LICENSE
LICENSE
 
 
Makefile
Makefile
 
 
PreRandom.cpp
PreRandom.cpp
 
 
PreRandom.h
PreRandom.h
 
 
README.md
README.md
 
 
allrates.cpp
allrates.cpp
 
 
channel.cpp
channel.cpp
 
 
channel.h
channel.h
 
 
dists.cpp
dists.cpp
 
 
dists.h
dists.h
 
 
ebc.cpp
ebc.cpp
 
 
ebc.h
ebc.h
 
 
enum.cpp
enum.cpp
 
 
extendedpeeling.cpp
extendedpeeling.cpp
 
 
getopt_pp.cpp
getopt_pp.cpp
 
 
getopt_pp.h
getopt_pp.h
 
 
gldpc.cpp
gldpc.cpp
 
 
gldpc.h
gldpc.h
 
 
gldpcsim.cpp
gldpcsim.cpp
 
 
gpcrate.cpp
gpcrate.cpp
 
 
graph.cpp
graph.cpp
 
 
graph.h
graph.h
 
 
itassert.h
itassert.h
 
 
main.cpp
main.cpp
 
 
rsgen.cpp
rsgen.cpp
 
 
simall.cpp
simall.cpp
 
 
simcodes.cpp
simcodes.cpp
 
 
simcoverage.cpp
simcoverage.cpp
 
 
simulation.cpp
simulation.cpp
 
 
sse_mathfun.cpp
sse_mathfun.cpp
 
 
sse_mathfun.h
sse_mathfun.h
 
 
tables.cpp
tables.cpp
 
 
utils.cpp
utils.cpp
 
 
utils.h
utils.h
 
 

Repository files navigation

graph-codes

An efficient implementation of bipartite graphs used in simulation of erasure codes. The underlying data-structure is a doubly-linked list which keeps track of imediate neighbours in the graph.

About

An efficient implementation of bipartite graphs for used in simulation of erasure codes

Resources

Readme
GPL-2.0 license
Activity

Stars

2 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

Packages

Contributors

Languages