Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  presents a novel method for constructing structured regular low-density parity-check (LDPC) codes based on a special type of combinatorial designs, known as Steiner systems. This code design approach can be considered as a generalization of the ll-known method which uses the point-block incidence matrix of a Steiner 2-design for the code construction. Though the given method can be applied on any Steiner system S(t, k, v), in this paper  focus only on Steiner systems with t ≥ 3. Furthermore,  show that not only a Steiner system (X,B) itself, but also its residual design with respect to an arbitrary point x ∈ X can be employed for code construction.  also present a technique for constructing binary and non-binary QC-LDPC codes from Steiner systems. The Tanner graph of the constructed codes is free of 4-cycles and hence the codes have girth at least six. Simulation results show that the so constructed codes perform ll over the AWGN channel with iterative message-passing decoding.
['Hossein Falsafain', 'Morteza Esmaeili']
I am writing a research paper on a idea A New Construction of Structured Binary Regular LDPC Codes Based on Steiner Systems with Parameter t>2
[{"from": "human", "value": "I am writing a research paper on a idea A New Construction of Structured Binary Regular LDPC Codes Based on Steiner Systems with Parameter t>2"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely:  presents a novel method for constructing structured regular low-density parity-check (LDPC) codes based on a special type of combinatorial designs, known as Steiner systems. This code design approach can be considered as a generalization of the ll-known method which uses the point-block incidence matrix of a Steiner 2-design for the code construction. Though the given method can be applied on any Steiner system S(t, k, v), in this paper  focus only on Steiner systems with t \u2265 3. Furthermore,  show that not only a Steiner system (X,B) itself, but also its residual design with respect to an arbitrary point x \u2208 X can be employed for code construction.  also present a technique for constructing binary and non-binary QC-LDPC codes from Steiner systems. The Tanner graph of the constructed codes is free of 4-cycles and hence the codes have girth at least six. Simulation results show that the so constructed codes perform ll over the AWGN channel with iterative message-passing decoding."}]