Temat: error-correcting code - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Some maximum multigraphs and edge/vertex distance colourings
Autorzy:: Skupień, Zdzisław
Powiązania:: https://bibliotekanauki.pl/articles/971931.pdf
Data publikacji:: 1995
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: (strong) chromatic index
chromatic number
matching
hypercube
error-correcting code
asymptotics
Opis:: Shannon-Vizing-type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree Δ(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d-index and chromatic d-number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their growth is found.
Źródło:: Discussiones Mathematicae Graph Theory; 1995, 15, 1; 89-106
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Error-Correcting Codes from k -Resolving Sets
Autorzy:: Bailey, Robert F.
Yero, Ismael G.
Powiązania:: https://bibliotekanauki.pl/articles/31343451.pdf
Data publikacji:: 2019-05-01
Wydawca:: Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
Tematy:: error-correcting code
k -resolving set
k -metric dimension
covering design
uncovering
grid graph
Opis:: We demonstrate a construction of error-correcting codes from graphs by means of k-resolving sets, and present a decoding algorithm which makes use of covering designs. Along the way, we determine the k-metric dimension of grid graphs (i.e., Cartesian products of paths).
Źródło:: Discussiones Mathematicae Graph Theory; 2019, 39, 2; 341-355
2083-5892
Pojawia się w:: Discussiones Mathematicae Graph Theory
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Low Density Parity Check Codes Constructed from Hankel Matrices
Autorzy:: Tehami, M. A.
Djebbari, A.
Powiązania:: https://bibliotekanauki.pl/articles/958065.pdf
Data publikacji:: 2018
Wydawca:: Instytut Łączności - Państwowy Instytut Badawczy
Tematy:: dual diagonal matrix
error correcting codes
girth
Hankel matrix
low density parity check code
Opis:: In this paper, a new technique for constructing low density parity check codes based on the Hankel matrix and circulant permutation matrices is proposed. The new codes are exempt of any cycle of length 4. To ensure that parity check bits can be recursively calculated with linear computational complexity, a dual-diagonal structure is applied to the parity check matrices of those codes. The proposed codes provide a very low encoding complexity and reduce the stored memory of the matrix H in which this matrix can be easily implemented comparing to others codes used in channel coding. The new LDPC codes are compared, by simulation, with uncoded bi-phase shift keying (BPSK). The result shows that the proposed codes perform very well over additive white Gaussian noise (AWGN) channels.
Źródło:: Journal of Telecommunications and Information Technology; 2018, 3; 37-41
1509-4553
1899-8852
Pojawia się w:: Journal of Telecommunications and Information Technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja