Error correcting codes via reversible cellular automata over finite fields

DOI10.1007/S13369-013-0757-0zbMath1391.94847OpenAlexW2024620452WikidataQ58473449 ScholiaQ58473449MaRDI QIDQ1639815

Mehmet E. Koroglu, Hasan Akin, Siap, Irfan

Publication date: 13 June 2018

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-013-0757-0

zbMATH Keywords

finite fieldserror correcting codesreversible cellular automata

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cellular automata (computational aspects) (68Q80) Dynamical aspects of cellular automata (37B15)

Related Items (3)

The Entropy and Reversibility of Cellular Automata on Cayley Tree ⋮ The reversibility problem for a family of two-dimensional cellular automata ⋮ Welch sets for random generation and representation of reversible one-dimensional cellular automata

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\)
• Characterization of two-dimensional cellular automata over ternary fields
• Characterization of two-dimensional cellular automata using matrix algebra
• Asymptotic equivalence between two linear Volterra difference systems
• Inverse rules of ECA with rule number 150
• Structure and reversibility of 2D hexagonal cellular automata
• Error-correcting linear codes. Classification by isometry and applications. With CD-ROM
• Design of CAECC - cellular automata based error correcting code
• Analysis of one-dimensional linear hybrid cellular automata over GF(q)
• ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p
• Error Correction Coding

This page was built for publication: Error correcting codes via reversible cellular automata over finite fields