Efficient Algorithms for the Construction of Low-Density Parity-Check Codes
Low-density parity-check (LDPC) codes are a form of high performance error-correcting codes with a substantial number of theories developed for their uses in classical and quantum systems. However, practical applications have been limited by the difficulty of finding good LDPC codes for specific parameters. The objective of this research is to devise efficient algorithmic methods for the construction of LDPC codes for practical parameters. The construction of a library of these codes using efficient algorithms would be a substantial benefit to the field of information security and society at large.