Framing, Error Detection and Correction

0.0(0)
studied byStudied by 0 people
GameKnowt Play
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/40

flashcard set

Earn XP

Description and Tags

41 vocabulary flashcards reviewing key terms from the lecture on framing, error detection, and error correction.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

41 Terms

1
New cards

Framing

The data-link layer process of dividing a bit stream into discrete frames for reliable transmission between two directly connected devices.

2
New cards

Data Link Layer

OSI layer responsible for framing, physical addressing, flow control, and error detection/correction over a single link.

3
New cards

Frame Header

The part of a frame that holds control information such as source and destination addresses.

4
New cards

Payload Field

The data portion of a frame that carries the network-layer packet or message being delivered.

5
New cards

Frame Trailer

The section of a frame containing error-detection or error-correction bits (e.g., CRC).

6
New cards

Frame Flag

A special pattern that marks the beginning and end of a frame (e.g., 01111110).

7
New cards

Fixed Size Framing

Framing technique in which every frame has the same length, so no explicit delimiter is needed.

8
New cards

Variable Size Framing

Framing method where frame lengths vary and boundaries are identified by length fields or delimiters.

9
New cards

Length Field

A field inside a variable-size frame that states the frame’s byte length (used in Ethernet 802.3).

10
New cards

End Delimiter (ED)

A unique pattern signaling the end of a frame in some networks, e.g., Token Ring.

11
New cards

Character-oriented Approach

Variable-size framing that treats each byte as a character and uses special characters as delimiters.

12
New cards

Bit-oriented Approach

Variable-size framing that uses specific bit patterns (not byte values) to mark frame boundaries.

13
New cards

Character Count Method

Obsolete framing technique that stores the number of characters in a header field to locate the frame end.

14
New cards

Byte Stuffing

Technique that inserts an escape byte before any data byte identical to a flag byte to preserve framing.

15
New cards

Flag Byte

The dedicated byte (often 01111110 in binary) used as both start-of-frame and end-of-frame marker.

16
New cards

Bit Stuffing

Process of inserting a 0 after every sequence of five consecutive 1s in the data to avoid flag imitation.

17
New cards

Stuffing

General practice of adding extra bits or bytes to data so that framing patterns are not mimicked inside the payload.

18
New cards

Single-Bit Error

A transmission fault in which exactly one bit of a data unit is altered.

19
New cards

Multiple-Bit Error

An error event that flips two or more, but not necessarily consecutive, bits in a data unit.

20
New cards

Burst Error

An error that affects consecutive bits, typically spanning several bits in one continuous sequence.

21
New cards

Error Detection

Techniques that reveal the presence of transmission errors without fixing them (e.g., parity, CRC).

22
New cards

Error Correction

Methods enabling a receiver to both detect and repair errors without needing retransmission.

23
New cards

Parity Bit

A single redundant bit added to data to make the total number of 1s either even or odd.

24
New cards

Checksum

Error-detection value obtained by summing data words and sending the result with the message.

25
New cards

Cyclic Redundancy Check (CRC)

Robust error-detection scheme that treats data as coefficients of a polynomial and applies polynomial division.

26
New cards

Backward Error Correction

Strategy where the receiver requests retransmission after detecting an error (automatic repeat request).

27
New cards

Forward Error Correction (FEC)

Strategy in which the receiver corrects errors by itself using redundant coding, avoiding retransmission.

28
New cards

Single-bit Error Detection

Minimal redundancy technique that can detect but not correct a one-bit fault within a data unit.

29
New cards

Hamming Code

Error-correcting scheme that introduces multiple parity bits to locate and correct single-bit errors.

30
New cards

Even Parity

Parity scheme where the parity bit is chosen so the total number of 1s in the data plus parity is even.

31
New cards

Odd Parity

Parity scheme where the parity bit makes the total count of 1s (data + parity) odd.

32
New cards

Reed–Solomon Code

Powerful block error-correcting code widely used in CDs, DVDs, and deep-space communication.

33
New cards

Turbo Code

Iterative forward error-correcting code that approaches the Shannon limit and is used in modern wireless links.

34
New cards

Error Detection Advantages

Low overhead, simple implementation, and quick processing because only error presence is checked.

35
New cards

Error Detection Disadvantages

Cannot fix errors; may miss some patterns; relies on potentially costly retransmissions.

36
New cards

Error Correction Advantages

Allows data recovery without retransmission, raising reliability in noisy or high-latency channels.

37
New cards

Error Correction Disadvantages

Introduces extra redundancy, higher computational complexity, and added latency for decoding.

38
New cards

Data Integrity

The assurance that received data is identical to what was sent, free of transmission errors.

39
New cards

Resynchronization

Receiver action of regaining frame boundary alignment after losing track due to bit errors.

40
New cards

Escape Byte

Special byte inserted during byte stuffing to indicate that the following byte is user data, not a delimiter.

41
New cards

Polynomial Division

Mathematical operation underlying CRC generation and checking, using modulo-2 arithmetic.