LDPC codes from triangle-free line sets (Q1877365): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Antonio Cossidente / rank | |||
Property / reviewed by | |||
Property / reviewed by: Antonio Cossidente / rank | |||
Normal rank | |||
Property / describes a project that uses | |||
Property / describes a project that uses: Magma / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/b:desi.0000029233.20866.41 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2034782429 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:10, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | LDPC codes from triangle-free line sets |
scientific article |
Statements
LDPC codes from triangle-free line sets (English)
0 references
16 August 2004
0 references
Let \(AG(n,q)\) and \(PG(n,q)\) be the finite affine and projective spaces respectively of dimension \(n\) over \(GF(q)\). A subset \(\mathcal L\) of lines of \(AG(n,q)\) or \(PG(n,q)\) is said to be triangle-free if no three nonconcurrent lines of \(\mathcal L\) form a triangle. If \(G\) is the bipartite graph whose vertices are the points of a finite space and whose edges are determined by natural inclusion, then the point-line graph associated with a triangle-free set turns out to have no cycles of length \(6\) and girth at least \(8\). It follows that the associated incidence matrix is relatively sparse and so can be used to construct a so-called low-density parity check code. In the paper under review the author gives two constructions of triangle-free sets and hence the parameters of the associated codes when \(q\) is sufficiently small.
0 references
cap
0 references
polarity
0 references