Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Reed–Muller_code> ?p ?o. }
Showing items 1 to 23 of
23
with 100 items per page.
- Reed–Muller_code abstract "Reed–Muller codes are a family of linear error-correcting codes used in communications. Reed–Muller codes belong to the classes of locally testable codes and locally decodable codes, which is why they are useful in the design of probabilistically checkable proofs in computational complexity theory. They are named after Irving S. Reed and David E. Muller. Muller discovered the codes, and Reed proposed the majority logic decoding for the first time. Special cases of Reed–Muller codes include the Hadamard code, the Walsh–Hadamard code, and the Reed–Solomon code.Reed–Muller codes are listed as RM(d, r), where d is the order of the code, and r determines the length of code, n = 2 r. RM codes are related to binary functions on the field GF(2 r) over the elements {0, 1}. RM(0, r) codes are repetition codes of length n = 2 r, rate and minimum distance dmin = n.RM(1, r) codes are parity check codes of length n = 2 r, rate and minimum distance .RM(r − 1, r) codes are parity check codes of length n = 2 r.RM(r − 2, r) codes are the family of extended Hamming codes of length n = 2 r with minimum distance dmin = 4.".
- Reed–Muller_code wikiPageID "2032752".
- Reed–Muller_code wikiPageRevisionID "585277090".
- Reed–Muller_code messageLength "depending on and".
- Reed–Muller_code name "Reed-Muller code RM".
- Reed–Muller_code namesake "Irving S. Reed and David E. Muller".
- Reed–Muller_code type Block_code.
- Reed–Muller_code subject Category:Coding_theory.
- Reed–Muller_code subject Category:Error_detection_and_correction.
- Reed–Muller_code comment "Reed–Muller codes are a family of linear error-correcting codes used in communications. Reed–Muller codes belong to the classes of locally testable codes and locally decodable codes, which is why they are useful in the design of probabilistically checkable proofs in computational complexity theory. They are named after Irving S. Reed and David E. Muller. Muller discovered the codes, and Reed proposed the majority logic decoding for the first time.".
- Reed–Muller_code label "Code de Reed-Müller".
- Reed–Muller_code label "Reed-Muller-Code".
- Reed–Muller_code label "Reed-Muller-code".
- Reed–Muller_code label "Reed–Muller code".
- Reed–Muller_code label "リード・マラー符号".
- Reed–Muller_code sameAs Reed%E2%80%93Muller_code.
- Reed–Muller_code sameAs Reed-Muller-Code.
- Reed–Muller_code sameAs Code_de_Reed-Müller.
- Reed–Muller_code sameAs リード・マラー符号.
- Reed–Muller_code sameAs Reed-Muller-code.
- Reed–Muller_code sameAs Q201972.
- Reed–Muller_code sameAs Q201972.
- Reed–Muller_code wasDerivedFrom Reed–Muller_code?oldid=585277090.