Abstract Syntax Notation One the single value byte 05 with less than 8 bits, if it knows that allowed values can only fit in a smaller range). Note also that the last 6 bits in the encoded PER are padded with null bits in the 6 least significant bits of the last byte c0 : these extra bits may not be transmitted or used for encoding something else if this sequence is inserted as a part of a longer unaligned PER sequence. This means that unaligned PER data is essentially an ordered stream of bits, and not an ordered stream of bytes like with
Consistent Overhead Byte Stuffing end of the packet. There are two equivalent ways to describe the COBS encoding process: These examples show how various data sequences would be encoded by the COBS algorithm. In the examples, all bytes are expressed as hexadecimal values, and encoded data is shown with text formatting to illustrate various features: Below is a diagram using example 3 from above table, to illustrate how each modified data byte is located, and how it is identified as a data byte or an end of frame byte. Examples 7 through 10 show how the overhead varies depending on the data being encoded