Online citations, reference lists, and bibliographies.

CHARACTERIZATION OF CODES OF IDEALS OF THE POLYNOMIAL RING F30 2 [x] Mod X30 1 FOR ERROR CONTROL IN COMPUTER APPLICATONS

Maurice Oduor, Olege Fanuel, Aywa Shem, Okaka Akinyi. Colleta
Published 2016 · Mathematics
Cite This
Download PDF
Analyze on Scholarcy
Share
The study of ideals in algebraic number system has contributed immensely inpreserving the notion of unique factorization in rings of algebraic integers and inproving Fermat's last Theorem. Recent research has revealed that ideals in Noethe-rian rings are closed in polynomial addition and multiplication.This property hasbeen used to characterize the polynomial ring Fn 2 [x] mod (xn 􀀀 1) for error control. In this research we generate ideals of the polynomial ring using GAP software and characterize the polycodewords using Shannon's Code region and Manin's bound.
This paper references
10.1109/DSN.2002.1028931
32-bit cyclic redundancy codes for Internet applications
Philip Koopman (2002)
TRELLISES AND TRELLIS-BASED DECODING ALGORITHMS FOR LINEAR BLOCK CODES Part 3
Shu
E (1949) â€oeNotes on digital coding
M J Golay
Cubic Forms 2nd Edition
Y I Manin (1986)
1950) â€oeError detecting and error correcting codes,― Bell Syst
R W Hamming
10.1201/9781439894699-14
Error-correcting Codes
Franz Lemmermeyer (2005)
“Cyclic Error-Correcting Codes in Two Symbolsâ€
E. Prange (1957)
Abstract Algebra second edition
C Charles (2000)
10.3934/amc.2008.2.451
Geometric constructions of optimal optical orthogonal codes
Tim L. Alderson (2008)
Error control coding - fundamentals and applications
Shu Lin (1983)
10.1109/MCOM.1987.1093590
The application of error control to communications
Elwyn R. Berlekamp (1987)
On improving data-link performance by increasing the channel alphabet and introducing sequence codin
Gottfried Ungerboeck (1976)
10.21236/ada156195
Error Control Coding Handbook
Joseph Odenwalder (1976)
10.1137/0108018
Polynomial Codes Over Certain Finite Fields
Irving S. Reed (1960)
10.1109/26.231911
Optimization of cyclic redundancy-check codes with 24 and 32 parity bits
Guy Castagnoli (1993)
10.1016/S0019-9958(60)90287-4
On A Class of Error Correcting Binary Group Codes
R. C. Bose (1960)
“Notes on digital coding,â€
Golay (1949)
10.1002/j.1538-7305.1952.tb01384.x
An application of Boolean algebra to switching circuit design
R. E. Staehler (1952)
10.1002/j.1538-7305.1950.tb00463.x
Error detecting and error correcting codes
Richard Wesley Hamming (1950)
Polynomial Codes Over Certain Finite Fields
Firm J. Dennis Moore (2017)
â€oeNear optimum error correcting coding and decoding: Turbo-codes,â€
C Berrou (1996)
10.1109/TCOM.1985.1096340
On the Undetected Error Probability for Shortened Hamming Codes
Toru Fujiwara (1985)
10.1109/26.539767
Near optimum error correcting coding and decoding: turbo-codes
Claude Berrou (1996)
10.1007/978-1-4419-7970-4_14
Coding for noisy channels
Robert M. Gray (2011)
E (1948) â€oeA mathematical theory of communication,― Bell Syst
C Shannon
A Mathematical Theory of Communication
Jin Woo Shin (2006)
Error Control Systems for Digital Communication and Storage
Stephen B. Wicker (1994)



This paper is referenced by
Semantic Scholar Logo Some data provided by SemanticScholar