2021•Unpublished venueRequires access

Cyclic Linear Codes, Shift Registers, and CRC

Aiden A. Bruen, Mario Professor Forcinito, James Professor McQuillan

Open publisher page 1 citations

Abstract

This chapter presents some basic material concerning linear cyclic codes from a very elementary point of view while covering all the main ideas. It then develops some more advanced results on linear cyclic codes. The chapter shows how linear feedback shift registers dovetail beautifully with linear cyclic codes using our approach to generators. The algebraic theory of shift registers is related to a cyclic redundancy check (CRC) protocol which is frequently used on the Internet and elsewhere. The CRC is used to detect link-level transmission errors while the Internet checksum, used by most Internet protocols, is designed to detect higher level transmission errors. CRCs use polynomial arithmetic.

About this research paper

What this paper is about

This chapter presents some basic material concerning linear cyclic codes from a very elementary point of view while covering all the main ideas. It then develops some more advanced results on linear cyclic codes. The chapter shows how linear feedback shift registers dovetail beautifully with linear cyclic codes using our approach to generators. The algebraic theory of shift registers is related to a cyclic redundancy check (CRC) protocol which is frequently used on the Internet and elsewhere. The CRC is used to detect link-level transmission errors while the Internet checksum, used by most Internet protocols, is designed to detect higher level transmission errors. CRCs use polynomial arithmetic.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This chapter presents some basic material concerning linear cyclic codes from a very elementary point of view while covering all the main ideas. It then develops some more advanced results on linear cyclic codes. The chapter shows how linear feedback shift registers dovetail beautifully with linear cyclic codes using our approach to generators. The algebraic theory of shift registers is related to a cyclic redundancy check (CRC) protocol which is frequently used on the Internet and elsewhere. The CRC is used to detect link-level transmission errors while the Internet checksum, used by most Internet protocols, is designed to detect higher level transmission errors. CRCs use polynomial arithmetic.

Key concepts: Cyclic redundancy check, Checksum, Shift register, Computer science, Coding theory, The Internet, Redundancy (engineering), Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
Cyclic Linear Codes, Shift Registers, and CRC — Research Paper | ScholarLens