Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Publication of BE533049ApublicationCriticalpatent/BE533049A/xx
H03M7/00—Conversion of a code where information is represented by a given sequence or number of digits to a code where the same, similar or subset of information is represented by a different sequence or number of digits
H03M7/30—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction
H03M7/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
H03M7/4025—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code constant length to or from Morse code conversion
H—ELECTRICITY
H03—ELECTRONIC CIRCUITRY
H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
H03M5/00—Conversion of the form of the representation of individual digits
H—ELECTRICITY
H04—ELECTRIC COMMUNICATION TECHNIQUE
H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
H04L17/00—Apparatus or local circuits for transmitting or receiving codes wherein each character is represented by the same number of equal-length code elements, e.g. Baudot code
H04L17/16—Apparatus or circuits at the receiving end
H04L17/30—Apparatus or circuits at the receiving end using electric or electronic translation
Landscapes
Engineering & Computer Science
(AREA)
Theoretical Computer Science
(AREA)
Computer Networks & Wireless Communication
(AREA)
Signal Processing
(AREA)
Indexing, Searching, Synchronizing, And The Amount Of Synchronization Travel Of Record Carriers
(AREA)