. . "203-206" . "Vl\u010Dek, Karel" . "ITERATIVE ECC DECODER WITH VERY SPARSE MATRICES SOLUTION" . "80-969117-9-1" . "ITERATIVE ECC DECODER WITH VERY SPARSE MATRICES SOLUTION" . "The paper presents Error-Correcting Codes (ECCs) with a new solution of sparse matrices. We consider the iterative flow of information in this network, and examine the average entropy of one bit as a function of number of iterations. Successful decoding will occur if the average entropy of a bit decreases to zero as the number of iterations increases. The aim of solution was the computation of the conditional entropy of the nominal bit given the state of all checks out to range. We have assumed that the sum/product decoder is used as a better algorithm than the free energy minimisation algorithm for solving this problem is used." . "Mitrych, J." . "RIV/70883521:28110/04:63502379!RIV/2005/GA0/281105/N" . . "2004-04-18+02:00"^^ . "RIV/70883521:28110/04:63502379" . "ITERATIVE ECC DECODER WITH VERY SPARSE MATRICES SOLUTION"@cs . . "ITERATIVE ECC DECODER WITH VERY SPARSE MATRICES SOLUTION"@en . . "[480EF5A20207]" . "ITERATIVE ECC DECODER WITH VERY SPARSE MATRICES SOLUTION"@en . "IEEE Slovensko" . . "1"^^ . "IEEE 2004" . . "Vor\u00E1\u010D, J." . . . "3"^^ . . "P(GA102/04/0737)" . . "V p\u0159\u00EDsp\u011Bvku je prezentov\u00E1n Error-Correcting Codes (ECCs)."@cs . "ITERATIVE ECC DECODER WITH VERY SPARSE MATRICES SOLUTION"@cs . . "Star\u00E1 Lesn\u00E1, Slovensko" . "Error-correcting codes (ECCs); Low-complexity decoding; Iterative code decoding; Shannon limit; Gallager codes; and Very sparse matrix"@en . "4"^^ . . . "The paper presents Error-Correcting Codes (ECCs) with a new solution of sparse matrices. We consider the iterative flow of information in this network, and examine the average entropy of one bit as a function of number of iterations. Successful decoding will occur if the average entropy of a bit decreases to zero as the number of iterations increases. The aim of solution was the computation of the conditional entropy of the nominal bit given the state of all checks out to range. We have assumed that the sum/product decoder is used as a better algorithm than the free energy minimisation algorithm for solving this problem is used."@en . . "569113" . "28110" . . . "Star\u00E1 Lesn\u00E1" . . .