Patent EP0086541A1 successfully refreshed from Google Patents.
EP0086541A1
Expired / Lapsed
EP
⏱️ 0.0 years remaining
System for communication by way of repeatedly transmitted messages, and stations for use in such a system
Assignee: Koninklijke Philips NV
•
Filing: 1983-02-11
•
Granted: —
•
Expires: 2003-02-11
Abstract
Abstract A description is given of a system for communication between a transmitting station (30) and a receiving station (33) by way of a message which consists of a direct succession of a number of identical code words. Each message uses only a comparatively small part of the capacity of the message channel. Each code word has at least a predetermined minimum Hamming distance with respect to any other code word, including the cyclic transpositions of the latter code word. Therefore, for the detection and reproduction of a code word it is not necessary to realize word synchronization and a given category of errors can still be detected and/or corrected. The code words may concern, for example, a transmitter or program identification in a broadcasting system or a paging code for a receiving station in a system comprising selectively addressable receiving stations as in a paging system.
Inventors
- 👤 Lodewijk Barend Vries
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-07 18:32
CPC Classifications
H; H04; H04L; H04L1/00; H04L1/08; H03; H03M; H03M13/00; H03M13/03; H03M13/05; H03M13/13; H03M13/15; H04H; H04H60/00; H04H60/68; H04H60/73; H04H60/74; H04L1/004; H04L1/0045; H04L1/0056; H04L1/0057; H04H20/00; H04H20/28; H04H2201/00; H04H2201/70; H04H60/09; H04H60/11
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
176 words
A system for communication between a transmitting station (30) and a receiving station (33) via a message channel (32/39) by way of a message which uses a comparatively small part of the transmission capacity of the message channel, the receiving station comprising separation means which are coupled to the message channel in order to separate a message therefrom, and also comprising a decoder (34/38) which is connected to the separation means in order to decode the message and to provide an output indication, characterized in that in the transmitting station a message is formed as a succession of p > 1 mutually identical code words of n > 1 bits each, said message being applied to the message channel, a code word having a given minimum Hamming distance ≥ 2 with respect to any other permissible code word, including the latter's cyclic transpositions thereof, so that at least one predetermined error can be detected, the decoder of the receiving station comprising decision means (34, 36, 38) for indicating a code word for a separated n-bit word.
Claim 2
Independent Claim
176 words
A system for communication between a transmitting station (30) and a receiving station (33) via a message channel (32/39) by way of a message which uses a comparatively small part of the transmission capacity of the message channel, the receiving station comprising separation means which are coupled to the message channel in order to separate a message therefrom, and also comprising a decoder (34/38) which is connected to the separation means in order to decode the message and to provide an output indication, characterized in that in the transmitting station a message is formed as a succession of p > 1 mutually identical code words of n > 1 bits each, said message being applied to the message channel, a code word having a given minimum Hamming distance ≥ 2 with respect to any other permissible code word, including the latter's cyclic transpositions thereof, so that at least one predetermined error can be detected, the decoder of the receiving station comprising decision means (34, 36, 38) for indicating a code word for a separated n-bit word.
Claim 3
Dependent Claim
57 words
A system as claimed in Claim 1, characterized in that a code word has a minimum Hamming distance in the bit space of at least three bits with respect to any other permissible code word, including the latter's cyclic transpositions, the decision means being capable of correcting at least one bit error in a separated n-bit word.
Claim 4
Dependent Claim
25 words
A transmitting station for use in a system as claimed in Claim 1 or 2, characterized in that the code word identifies the transmitting station.
Claim 5
Dependent Claim
47 words
A transmitting station for use in a system as claimed in Claim 1 or 2, characterized in that the transmitting station is suitable for the transmission of several, different code words in order to selectively activate a receiving station which is identified by an associated code word.
Claim 6
Dependent Claim
21 words
A transmitting station as claimed in Claim 4, characterized in that the set of permissible code words forms a non-linear code.
Claim 7
Dependent Claim
58 words
A receiving station for use in conjunction with a transmitting station as claimed in Claim 3 and based on a linear code, characterized in that the decision means comprise multiplier means (34) for forming, using a parity check matrix, a syndrome value in order to reconstruct a code word from the separated n-bit word and the syndrome value.
Claim 8
Dependent Claim
46 words
A receiving station for use in conjunction with a transmitting station as claimed in Claim 4 or 5, characterized in that the receiving station forms an internal activation signal under the control of a predetermined sub-set of code words, and otherwise remains in an alert condition.
References Cited (Backward Citations)
US3510777A
Cited
DE2807706A1
Cited
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.