CRTECC (5c,16) Confusion-Free Error-Correcting Characterization code

EXTENDED ALPHA-NUMERIC EDITION

Step-by-Step Demonstration of Modulus Error Correcting Code utilizing Chinese Remainder Theorem.

Based on the Charmsec^® CoDec Library | JP,7142977,B

1. Transmitter Stage (Encoding)

Stage 1: Transmission Data (Positional Number System [0 : minmodmax])

Stage 2-A: Modulus Residue Vector (vector, RRNS: Redundant Residue Number System Representation):

Stage 2-B: Transmission Code (Mapped to Characters):

Random symbol (character) error generation:

Inject a random single-character error into the corresponding modulus symbol.

Stage 3: Received Code (with or without Error):

* Non-code symbols (unmapped characters) are automatically represented as \ (backslash) indicator.

Stage 4: CRT Restored Candidates:

Stage 5: Corrected Final Data (rxdata):

Waiting for status...

47 characters from Alphanumeric used in CRTECC, excluding visually confusing characters:

0123456789
A  DEFGH  KLMN PQR TUV XY 
a cdefgh jk mn pqrstu w y

H. Miyakawa, Y. Iwadare, and H. Imai, Coding Theory (Computer Science Course Vol. 18), The Institute of Electronics, Information and Communication Engineers (IEICE), Corona Publishing Co., Ltd., 1973, ISBN4-88552-180-7 (in Japanese).