Talk:Block code

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Telecommunications

	Telecommunication portal This article is within the scope of WikiProject Telecommunications, a collaborative effort to improve the coverage of Telecommunications on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.TelecommunicationsWikipedia:WikiProject TelecommunicationsTemplate:WikiProject TelecommunicationsTelecommunications
???	This article has not yet received a rating on the project's importance scale.

Block code received a peer review by Wikipedia editors, which is now archived. It may contain ideas you can use to improve this article.

Comments originally with no section title

This was marked for speedy deletion. I doubt that it qualifies for that.

Charles Matthews 13:48, 5 Nov 2004 (UTC)

Right - it started life as a graffito, but now has content. Keep.

Charles Matthews 13:50, 5 Nov 2004 (UTC)

In the article at present it is stated that a block code is characterised by encoding the information symbols consecutively. I have doubts if that is correct. In my opinion, the main characterisation of a block code is that it is a fixed length channel code (unlike source coding schemes such as Huffman coding, and unlike channel coding methods like convolutional encoding).

In my opinion it is however possible that a block code takes a k-digit information word, and transforms this into an n-digit codeword, without there being the possibility to a symbol by symbol encoding of the information digits. Bob.v.R 11:26, 17 September 2005 (UTC)[reply]

No answer sofar. I will now in the article make the distinction more clearly between the practical and the theoretical definition. Bob.v.R 17:42, 23 September 2005 (UTC)[reply]

Cleanup Template

This article lacks important information, and some of that it provides is incorrect. Nageh (talk) 17:33, 9 October 2009 (UTC) Particularly it needs to cover block codes in more detail, introduce linear and non-linear codes, and important theoretical bounds to block codes such as the Hammington and Singleton bounds. Nageh (talk) 17:38, 9 October 2009 (UTC)[reply]

Distance d of two Blockcodes

How is the Distance of two Blockcodes defined? What is the Distance of (2,0) and (0,0)? —Preceding unsigned comment added by 84.140.251.84 (talk) 20:34, 3 February 2010 (UTC)[reply]

Notes

Atri Rudra, CSE545 Error Correcting Codes: Combinatorics, Algorithms and Applications, State University of New York at Buffalo.
P Vijay Kumar, Error Correcting Codes, Available on-line, Video lectures, Lecture notes

The "Notes" section was removed: the CSE545 is not a published source, the Kumar Video and Notes links were non-responsive. Rgdboer (talk) 01:23, 11 November 2016 (UTC)[reply]

Tree code MIA

A non-terminated convolutional encoder would be an example of a non-block (unframed) code, which has memory and is instead classified as a tree code.

Wikipedia lacks tree code. The following reference struck me as succinct:

ECE8771 Information Theory & Coding for Digital Communications — Prof. Kevin M. Buckley — Lecture Set 3 Convolutional Codes

Generally, we consider encoders which generate an output stream of codeword symbols from an input stream of data symbols. The resulting code is termed a tree code. A trellis code, which can be represented with a trellis, is a tree code with a finite-state encoder whose states depend only on a finite number of past input symbols. A trellis code that adheres to certain linearity properties is termed a convolutional code.

How about a tree code section in the trellis page, which this article could then link to? My math is a little too rusty to take this edit on myself with any surety. — MaxEnt 02:31, 17 March 2018 (UTC)[reply]