22,99 €
inkl. MwSt.
Versandfertig in 6-10 Tagen
11 °P sammeln
Andere Kunden interessierten sich auch für
![Semi-Log Graph]( "Semi-Log Graph")
Semi-Log Graph19,99 €![Snark Graph Theory]( "Snark Graph Theory")
Snark Graph Theory19,99 €![The American Practical Brewer and Tanner]( "The American Practical Brewer and Tanner")
The American Practical Brewer and Tanner19,90 €![Knowledge graph for Decision Engine]( "Knowledge graph for Decision Engine")
Knowledge graph for Decision Engine29,99 €![Design of Reconfigurable Antennas Using Graph Models]( "Design of Reconfigurable Antennas Using Graph Models")
Design of Reconfigurable Antennas Using Graph Models48,14 €![Multivariable Control a Graph-theoretic Approach]( "Multivariable Control a Graph-theoretic Approach")
Multivariable Control a Graph-theoretic Approach83,99 €![The American Practical Brewer and Tanner]( "The American Practical Brewer and Tanner")
The American Practical Brewer and Tanner12,90 €
High Quality Content by WIKIPEDIA articles! A Tanner graph is a bipartite graph used to specify constraints or equations which specify error correcting codes. In coding theory, Tanner graphs are used to construct longer codes from smaller ones. Both encoders and decoders employ these graphs extensively. Tanner graphs were proposed by Michael Tanner as a means to create larger error correcting codes from smaller ones using recursive techniques. He generalized the techniques of Elias for product codes. Tanner discussed lower bounds on the codes obtained from these graphs irrespective of the specific characteristics of the codes which were being used to construct larger codes.