| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 596 1 |
| Ultima descărcare din IBN: 2019-06-05 15:31 |
| Căutarea după subiecte similare conform CZU |
| 004.416.2+519.1 (1) |
| Programe. Software (295) |
| Analiză combinatorică. Teoria grafurilor (114) |
 SM ISO690:2012RABEFIHAVANANA, L., ANDRIATAHINY, H., RABEHERIMANANA, T.. Error correcting codes from sub-exceeding functions. In: Computer Science Journal of Moldova, 2019, nr. 1(79), pp. 34-55. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
  Computer Science Journal of Moldova |
||||||
| Numărul 1(79) / 2019 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 004.416.2+519.1 | ||||||
| Pag. 34-55 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
In this paper, we present linear systematic error-correcting codes Lk and L+ k which are the results of our research on the sub-exceeding functions. Given an integer k such that k ≥ 3, these two codes are respectively [2k, k] and [3k, k] linear codes. The minimum distance of L3 is 3 and for k ≥ 4 the minimum distance of Lk is 4. The code L+ k , the minimum distances are respectively 5 and 6 for k = 4 and k ≥ 5. By calculating the complexity of the algorithms, our codes have fast and efficient decoding. Then, for a short and medium distance data transmission (wifi network, bluetooth, cable, ...), we see that the codes mentioned above present many advantages. |
||||||
| Cuvinte-cheie Error correction code, encoding, decoding, subexceeding function |
||||||
|
Dublin Core Export
<?xml version='1.0' encoding='utf-8'?> <oai_dc:dc xmlns:dc='http://purl.org/dc/elements/1.1/' xmlns:oai_dc='http://www.openarchives.org/OAI/2.0/oai_dc/' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xsi:schemaLocation='http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd'> <dc:creator>Rabefihavanana, L.</dc:creator> <dc:creator>Andriatahiny, H.</dc:creator> <dc:creator>Rabeherimanana, T.</dc:creator> <dc:date>2019-05-29</dc:date> <dc:description xml:lang='en'><p>In this paper, we present linear systematic error-correcting codes Lk and L+ k which are the results of our research on the sub-exceeding functions. Given an integer k such that k ≥ 3, these two codes are respectively [2k, k] and [3k, k] linear codes. The minimum distance of L3 is 3 and for k ≥ 4 the minimum distance of Lk is 4. The code L+ k , the minimum distances are respectively 5 and 6 for k = 4 and k ≥ 5. By calculating the complexity of the algorithms, our codes have fast and efficient decoding. Then, for a short and medium distance data transmission (wifi network, bluetooth, cable, ...), we see that the codes mentioned above present many advantages.</p></dc:description> <dc:source>Computer Science Journal of Moldova 79 (1) 34-55</dc:source> <dc:subject>Error correction code</dc:subject> <dc:subject>encoding</dc:subject> <dc:subject>decoding</dc:subject> <dc:subject>subexceeding function</dc:subject> <dc:title>Error correcting codes from sub-exceeding functions</dc:title> <dc:type>info:eu-repo/semantics/article</dc:type> </oai_dc:dc>
|
|
|
