?? the art of error correcting coding hamming, golay and reed-muller.htm
字號:
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<!-- saved from url=(0044)http://the-art-of-ecc.com/2_Short/index.html -->
<HTML><HEAD><TITLE>The Art of Error Correcting Coding: Hamming, Golay and Reed-Muller</TITLE>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="Robert Morelos-Zaragoza" name=Author>
<META
content="Error Control Coding,Error CorrectingCoding,Error Correcting Codes,FEC,Turbo Codes,Iterative Decoding,DigitalCommunications,Wireless,Satellite,Data,Coded Modulation,Golay,Hamming,BCH,Reed Solomon,Viterbi Decoder,Soft Decision Decoding,Sudan Algorithm,Unequal Error Protection,Variable Rate Coding,Adaptive Coding,Convolutional Codes,LDPC,Low-Density Parity-Check Codes,The Art of Error-Correcting Coding,Capacity-achieving codes,Coding is not dead, is more alive than ever"
name=description>
<META content="MSHTML 6.00.2900.3395" name=GENERATOR></HEAD>
<BODY bgColor=#ffffff>
<CENTER><B><FONT size=+1>Short Linear Block Codes:</FONT></B> <B><FONT
size=+1>Hamming, Golay and Reed-Muller codes</FONT></B></CENTER>
<P>This is covered in Chapter 2 of the <A
href="http://www.amazon.com/gp/product/0470015586/ref=sr_11_1/102-3025380-7157754?ie=UTF8">book</A>.
<BR> </P>
<P><B>Encoding and decoding of a Hamming code:</B> <BR><A
href="http://the-art-of-ecc.com/2_Short/hamming.c">hamming.c</A> </P>
<P>The decoding algorithm used in hamming.c is unique in the sense that the
syndrome of the receive word gives directly the decimal representation of the
error position. <BR> </P><B>Encoding and decoding of the binary
(23,12,7) Golay code:</B><SPAN style="TEXT-DECORATION: underline"><BR></SPAN><A
href="http://the-art-of-ecc.com/2_Short/golay23.c">golay23.c</A>
<P></P>Encoding and decoding are implemented with lookup tables. <BR><BR><SPAN
style="FONT-WEIGHT: bold">Weight distribution of the binary (23,12,7) Golay
code:</SPAN><BR><A
href="http://the-art-of-ecc.com/2_Short/WD_golay23.m">WD_golay23.m</A><BR><BR>
<P><B>Encoding and decoding of the binary extended (24,12,8) Golay
code:</B> <BR><A
href="http://the-art-of-ecc.com/2_Short/golay24.c">golay24.c</A> </P>
<P>An arithmetic decoding algorithm. It is a very close relative of the
error-trapping decoding algorithms developed by Kasami in the 1960s.
<BR> </P>
<P><B>Encoding and soft-decision decoding of the first-order RM code,
RM(1,3):</B> <BR><A
href="http://the-art-of-ecc.com/2_Short/rm13_awgn.c">rm13_awgn.c</A> </P>
<P>Decoding with the Green machine. Binary transmission over an AWGN channel.
<BR></P>
<P><BR></P>
<P><B><A href="http://the-art-of-ecc.com/topics.html">BACK TO CONTENTS</A></B>
<BR></P>
<HR>
<H6 style="FONT-WEIGHT: normal"><SMALL><FONT color=#000000>This page was last
updated on August 6, 2008, by Robert H. Morelos-Zaragoza.</FONT></SMALL></H6><!-- text below generated by server. PLEASE REMOVE --><!-- Counter/Statistics data collection code -->
<SCRIPT language=JavaScript
src="The Art of Error Correcting Coding Hamming, Golay and Reed-Muller.files/whv2_001.js"></SCRIPT>
<SCRIPT language=javascript>geovisit();</SCRIPT>
<NOSCRIPT><IMG height=1 alt=setstats
src="The Art of Error Correcting Coding Hamming, Golay and Reed-Muller.files/visit.gif"
width=1 border=0></NOSCRIPT></BODY></HTML>
?? 快捷鍵說明
復制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -