Home | Community | Message Board


This site includes paid links. Please support our sponsors.


Welcome to the Shroomery Message Board! You are experiencing a small sample of what the site has to offer. Please login or register to post messages and view our exclusive members-only content. You'll gain access to additional forums, file attachments, board customizations, encrypted private messages, and much more!

Unfolding Nature Shop: Unfolding Nature: Being in the Implicate Order

Jump to first unread post Pages: 1
OfflineHighTek
A FunkyPhoenician
Male User Gallery


Registered: 03/22/07
Posts: 1,091
Loc: In your pants.
Last seen: 8 months, 12 days
Coding Theory
    #9952673 - 03/11/09 04:22 PM (14 years, 10 months ago)

Does anyone know anything about Coding Theory (other than wikiepdia)? Can anyone recommend some books or other literature regarding Coding Theory?

I need to find out all I can before this summer.


Extras: Filter Print Post Top
OfflineSeussA
Error: divide byzero


Folding@home Statistics
Registered: 04/27/01
Posts: 23,480
Loc: Caribbean
Last seen: 2 months, 19 days
Re: Coding Theory [Re: HighTek]
    #9952768 - 03/11/09 04:35 PM (14 years, 10 months ago)

Coding theory as in data encryption, data transmission, error correction, etc?


--------------------
Just another spore in the wind.


Extras: Filter Print Post Top
OfflineHighTek
A FunkyPhoenician
Male User Gallery


Registered: 03/22/07
Posts: 1,091
Loc: In your pants.
Last seen: 8 months, 12 days
Re: Coding Theory [Re: Seuss]
    #9952830 - 03/11/09 04:42 PM (14 years, 10 months ago)

Yeah... this is what the program will be comprised of:

Topic: Coding Theory

Communication of information often takes place over noisy channels that can corrupt the messages sent over them. For reliability of communication, it is often desirable to encode the transmitted information in such a way that errors can be detected and/or corrected when they occur. Finding methods that achieve error control without introducing undue redundancy, and that admit efficient encoding and decoding, is the main goal of coding theory.

Consider a communications environment in which messages are divided into words or blocks of a fixed length, k, formed using a finite alphabet with q symbols. The simplest case (the one best adapted to electronic hardware) is an alphabet with two symbols, the binary digits 0, 1. Indeed, in the codes used for the transfer of digital information within computer systems, and for storing information on compact disks, or other media and retrieving it for use at a later time, q is either 2 or a power of 2. The alphabet with exactly two symbols can be identified with the finite field , but the theory is substantially the same if the alphabet is any finite field . In order to detect and/or correct errors when they occur, some redundancy must be built into the information that is transmitted over the channel. One possible approach is to make the encoded form of a message consist of blocks or n-tuples of length n>k over the same alphabet used for the message itself. Codes obtained in this way are called block codes of length n over the alphabet.

A short course will be given in introduction to the theory of block codes over and other finite fields including: the Hamming distance, the parameters n,k,d of codes and some elementary bounds (Gilbert-Varshamov, Hamming, Singleton, etc.) on the parameters, linear codes, generator and parity check matrices for encoding and syndrome decoding, some important examples such as Hamming and Golay codes, cyclic codes and associated polynomial algebra, general finite fields, Reed-Solomon and BCH codes, algebraic decoding algorithms.

The basic decoding method for Reed-Solomon codes (leading up to the Berlekamp-Massey algorithm) is designed to correct up to t=[(d-1)/2]=[(n-k)/2] errors in a received word. By results on the error-correcting capacity of a code in terms of its minimum distance, this restriction on the number of errors is necessary if we ask for a method that returns only one closest codeword for each received word. There has been a surge of interest in different algorithms for Reed-Solomon and other codes in recent years.

Starting with work of Sudan in the late 1990’s and followed by work of Guruswami & and Sudan and Roth & Ruckstein, a significant amount of work has been devoted to methods that produce a list of all codewords within some specified distance (possibly >t above) of the received word.


Edited by HighTek (03/11/09 04:59 PM)


Extras: Filter Print Post Top
Jump to top Pages: 1

Unfolding Nature Shop: Unfolding Nature: Being in the Implicate Order


Similar ThreadsPosterViewsRepliesLast post
* Designing Codes, Possible to make undecipherable?
( 1 2 all )
HagbardCeline 4,182 20 08/31/03 07:49 PM
by Mal_Fenderson
* My theory on the speed of light.
( 1 2 all )
poke smot! 3,524 21 06/20/06 01:53 PM
by pod3
* Light Transmitting Concrete Edame 1,417 9 03/18/04 08:11 PM
by Joshua
* Transmitting data to a moving vehicle -- Wardriving, basically
( 1 2 3 all )
Baby_Hitler 3,966 40 06/02/05 05:00 PM
by Baby_Hitler
* Big Bang Theory Busted By 33 Top Scientists
( 1 2 all )
FrankieJustTrypt 5,479 27 08/06/11 11:17 PM
by cortex
* Software Developer Deciphers Shredded Paper's Code wingnutx 1,865 9 10/16/03 09:08 PM
by Joshua
* The boundary of informational compression whiterasta 1,011 5 08/19/03 11:44 PM
by monoamine
* I want to build a long distance (15+ Mi.) wireless network. Baby_Hitler 982 11 03/03/06 05:19 AM
by ChuangTzu

Extra information
You cannot start new topics / You cannot reply to topics
HTML is disabled / BBCode is enabled
Moderator: trendal, automan, Northerner
581 topic views. 0 members, 0 guests and 2 web crawlers are browsing this forum.
[ Show Images Only | Sort by Score | Print Topic ]
Search this thread:

Copyright 1997-2024 Mind Media. Some rights reserved.

Generated in 0.02 seconds spending 0.004 seconds on 12 queries.