What is the maximum overhead in byte-stuffing algorithm?
Answers
Answered by
0
Step-by-step explanation:
Hey dear. ❤
Answer...
The extra length of the transformed sequence is typically referred to as the overhead of the algorithm.
The COBS algorithm tightly bounds the worst-case overhead, limiting it to a minimum of one byte and a maximum of ⌈n/254⌉ bytes (one byte in 254, rounded up).
❤✌Hope it will be help ful for u ❤✌
Answered by
0
Answer:
2n
Step-by-step explanation:
The maximum overhead will occur when payload consists of only ESC and FLAG bytes.
Thus, every byte will require extra stuffing.
Hence, the maximum overhead in byte-stuffing algorithm is 2n.
Similar questions