← Back to Patent Explorer
US4490712A Expired / Lapsed US ⏱️ 0.0 years remaining

Information transcoding process and a transmission system using such a process

Assignee: Lignes Telegraphiques et Telephoniques LTT SA
•
Filing: 1981-07-27
•
Granted: 1984-12-25
•
Expires: 2001-07-27
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A process and system are provided for transmitting additional information, called order track, superimposed on the information to be transmitted, by alteration of the coding law. The process involves: detection of at least one possible value of the information to be transmitted, for which the coding law is altered depending on the order track information. The first coding is transformed into a second coding by choice of one of several alphabets capable of ensuring such a transformation, this choice being effected depending on the value of the current numerical sum, in accordance with the coding law such that the value of this numerical sum is minimized. the output at one end of the transmission channel of the information is expressed in the second coding as altered by the order track. The information received at the other end of the transmission channel is transformed into information expressed in the first coding. The order track is detected by detection of the alteration in the coding law.

Inventors

  • 👤 Claude Gourdon
  • 👤 Jean Thivend

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 21:46
CPC Classifications
H; H04; H04L; H04L25/00; H04L25/38; H04L25/40; H04L25/49; H04L25/4917; H04L25/4923; H04L25/4925

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 164 words
A process for transcoding information to be transmitted over a transmission channel and expressed in a first code, comprising the steps of: transforming information in the first code into a second code by choosing one of a plurality of alphabets capable of insuring such a transformation, said choosing being effected depending on the value of the current numerical sum, in accordance with a coding law whereby the value of said numerical sum is minimized; receiving order track information; detecting at least one possible value of the information to be transmitted, for which the coding law is altered depending on the value of said order track information; outputting at one end of said transmission channel the information expressed in said second code which has been altered by said transmitted order track information; transforming of the information received at the other end of said transmission channel into information expressed in said first code; detecting of the order track by detecting said alterations in the coding law.
Claim 2
Dependent Claim 164 words
A process for transcoding information to be transmitted over a transmission channel and expressed in a first code, comprising the steps of: transforming information in the first code into a second code by choosing one of a plurality of alphabets capable of insuring such a transformation, said choosing being effected depending on the value of the current numerical sum, in accordance with a coding law whereby the value of said numerical sum is minimized; receiving order track information; detecting at least one possible value of the information to be transmitted, for which the coding law is altered depending on the value of said order track information; outputting at one end of said transmission channel the information expressed in said second code which has been altered by said transmitted order track information; transforming of the information received at the other end of said transmission channel into information expressed in said first code; detecting of the order track by detecting said alterations in the coding law.
Claim 3
Dependent Claim 23 words
The process as claimed in claim 1, wherein the first code is a binary code and the second code is a ternary code.
Claim 4
Dependent Claim 51 words
The process as claimed in claim 1, wherein the information expressed in said codes is organized into words comprising a first given number of characters for the first code and a second given number of characters for the second code, the numerical sum being indicated at the end of each word.
Claim 5
Dependent Claim 50 words
The process as claimed in claim 1, wherein the alteration in the coding law is made for one of the possible values of a word of the first code, and when said numerical sum assumes at least two values, said alteration being chosen from the lowest of the possible values.

References Cited (Backward Citations)

US3783383A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-12-25 1988-06-25 1988-12-25 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-12-25 1992-06-25 1992-12-25 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-12-25 1996-06-25 1996-12-25 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag