Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Codes Detecting and Correcting Solid Burst Errors

Bulletin of Electrical Engineering and Informatics · Vol. 1 No. 3 (2012)

DOI
10.12928/eei.v1i3.240
ISSN
2089-3191, 2302-9285
Terbit
2012-09-21
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en

Abstrak

This paper studies linear codes capable of detecting and correcting solid burst error of length b or less. The lower and upper bounds on the number of parity-check digits required for such codes are obtained. Illustrations of codes for detecting as well as correcting such errors are provided.

Kata kunci

Jaringan kolaborasi para penulis

Belum ada rekan penulis di Melola.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Codes Detecting and Correcting Solid Burst Errors</dc:title><dc:creator>Pankaj Kumar Das</dc:creator><dc:subject>linear codes</dc:subject><dc:subject>error detection</dc:subject><dc:subject>error correction</dc:subject><dc:subject>lower bounds</dc:subject><dc:subject>upper bounds</dc:subject><dc:subject>burst error correction</dc:subject><dc:description xml:lang="en">This paper studies linear codes capable of detecting and correcting solid burst error of length b or less. The lower and upper bounds on the number of parity-check digits required for such codes are obtained. Illustrations of codes for detecting as well as correcting such errors are provided.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2012-09-21</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:identifier>https://doi.org/10.12928/eei.v1i3.240</dc:identifier><dc:identifier>10.12928/eei.v1i3.240</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 1 No 3 (2012)</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language></oai_dc:dc>