000099195 001__ 99195
000099195 005__ 20190117192452.0
000099195 0247_ $$2doi$$a10.1109/ISIT.2000.866497
000099195 037__ $$aCONF
000099195 245__ $$aDesign of provably good low-density parity check codes
000099195 260__ $$c2000
000099195 269__ $$a2000
000099195 336__ $$aConference Papers
000099195 520__ $$aWe design sequences of low-density parity check codes that provably perform at rates extremely close to the Shannon capacity. These codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides. We further show that under suitable conditions the message densities fulfil a certain symmetry condition which we call the consistency condition and we present a stability condition which is the most powerful tool to date to bound/determine the threshold of a given family of low-density parity check codes
000099195 6531_ $$aalgoweb_ldpc
000099195 700__ $$aRichardson, T.
000099195 700__ $$0241952$$aShokrollahi, A.$$g156849
000099195 700__ $$aUrbanke, R.
000099195 773__ $$q199$$tProceedings of the IEEE International Symposium on Information Theory, ISIT 2000
000099195 909CO $$ooai:infoscience.tind.io:99195$$pIC$$pconf
000099195 909C0 $$0252198$$pALGO$$xU10735
000099195 937__ $$aALGO-CONF-2000-004
000099195 970__ $$aRichardson2000/ALGO
000099195 973__ $$aOTHER$$rREVIEWED$$sPUBLISHED
000099195 980__ $$aCONF