imported>Qwerfjkl (bot): Implementing WP:PIQA (Task 26)

2024-01-27T22:34:13Z

New page

{{WikiProject banner shell|class=C|
{{WikiProject Telecommunications }}
}}
{{oldpeerreview|archive=1}}

==Comments originally with no section title==

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

[[User:Charles Matthews|Charles Matthews]] 13:48, 5 Nov 2004 (UTC)

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

[[User:Charles Matthews|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.
[[User:Bob.v.R|Bob.v.R]] 11:26, 17 September 2005 (UTC)

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

== Cleanup Template ==
This article lacks important information, and some of that it provides is incorrect. [[User:Nageh|Nageh]] ([[User talk: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 bound|Hammington]] and [[Singleton bound]]s. [[User:Nageh|Nageh]] ([[User talk:Nageh|talk]]) 17:38, 9 October 2009 (UTC)

== Distance d of two Blockcodes ==
How is the Distance of two Blockcodes defined?
What is the Distance of (2,0) and (0,0)? <span style="font-size: smaller;" class="autosigned">—Preceding [[Wikipedia:Signatures|unsigned]] comment added by [[Special:Contributions/84.140.251.84|84.140.251.84]] ([[User talk:84.140.251.84|talk]]) 20:34, 3 February 2010 (UTC)</span> 
== 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, [http://www.nptel.iitm.ac.in/courses/117108044/ Video lectures], [http://www.nptel.iitm.ac.in/courses/117108044/module1/Lecture_Notes.pdf Lecture notes]

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

== Tree code MIA ==

<blockquote>
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''.
</blockquote>

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

* [http://maesoumi.epage.ir/images/maesoumi/content/coding/set3.pdf ECE8771 Information Theory & Coding for Digital Communications — Prof. Kevin M. Buckley — Lecture Set 3 Convolutional Codes]

<blockquote>
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.
</blockquote>

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. — [[user:MaxEnt|MaxEnt]] 02:31, 17 March 2018 (UTC)

Talk:Block code - Revision history

imported>Qwerfjkl (bot): Implementing WP:PIQA (Task 26)