Standard array: Difference between revisions

Revision as of 19:57, 7 August 2019

Latest revision as of 21:44, 26 December 2023

(4 intermediate revisions by 4 users not shown)

Line 1:

{{Short description|Array for a particular vector space}}

In [[coding theory]], a '''standard array''' (or Slepian array) is a <math>q^{n-k}</math> by <math>q^{k}</math> array that lists all elements of a particular <math>\mathbb{F}_q^n</math> [[vector space]]. Standard arrays are used to [[Decoding methods|decode]] [[linear code]]s; i.e. to find the corresponding [[Code word (communication)|codeword]] for any received vector.

== Definition ==

Line 5 ⟶ 6:

A standard array for an [''n'',''k'']-code is a <math>q^{n-k}</math> by <math>q^{k}</math> array where:

# The first row lists all [[Code word (communication)|codewords]] (with the <u>0</u> codeword on the extreme left)

# Each row is a [[coset]] with the [[coset leader]] in the first column

# The entry in the i-th row and j-th column is the sum of the i-th coset leader and the j-th codeword.

Line 137 ⟶ 138:

|}

In this example we could not have chosen the vector 0001 as the coset leader of the final row, even though it meets the critediacriteria of having minimal weight (1), because the vector was already present in the array. We could, however, have chosen it as the first coset leader and constructed a different standard array.

== Decoding via standard array ==

Line 155 ⟶ 156:

|last = Hill

|first = Raymond

|authorlinkauthor-link = Raymond Hill (computer scientist)|

|title = A First Course in Coding Theory

|url = https://archive.org/details/firstcourseincod0000hill

|url-access = registration

|publisher = [[Oxford University Press]]

|series = Oxford Applied Mathematics and Computing Science series