CN100435591C - A method for implementing invisible character transmission on short message communication platform - Google Patents
A method for implementing invisible character transmission on short message communication platform Download PDFInfo
- Publication number
- CN100435591C CN100435591C CNB2003101177180A CN200310117718A CN100435591C CN 100435591 C CN100435591 C CN 100435591C CN B2003101177180 A CNB2003101177180 A CN B2003101177180A CN 200310117718 A CN200310117718 A CN 200310117718A CN 100435591 C CN100435591 C CN 100435591C
- Authority
- CN
- China
- Prior art keywords
- codings
- character
- visible
- invisible
- short message
- Prior art date
- Legal status (The legal status 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 status listed.)
- Expired - Fee Related
Links
Abstract
The present invention discloses a method for implementing invisible character transmission on a short message communication platform. In the method, firstly, six-bit codes and tables corresponding to visible characters are respectively defined at a communication transmitting terminal and a receiving terminal of short messages; data (eight-bit codes) to be transmitted is converted into a six-bit code; the six-bit codes and the tables corresponding to visible characters are searched, and corresponding visible characters are searched out; the visible characters are transmitted to a control center by a short message SMS; the control center searches out the corresponding six-bit code according to the received visible characters from the six-bit codes and the tables corresponding to visible characters; the six-bit code is converted into the original data of the eight-bit code by inverse operation. The problem of transmitting invisible characters is solved by the method; additionally, visible characters can also use the method, and in this way, codes transmitted in the transmission process are not original codes; simultaneously, the problem of poor transmission safety of plaintexts is solved.
Description
Technical field
The present invention relates to method, relate in particular to the transmission of invisible character by the note transmission character.
Background technology
Present note can only be advanced transmission to character visible, promptly only (0X00~0XFF) middle 0X20~interior character of 0X7F scope transmits to the ASCII character table, to general SMS, the content of its transmission all is a character visible, but when transmitting the information of some field such as GPS vehicle satellite fix with note, some invisible characters are just extremely important in information of vehicles, if only transmit the character visible part, then miss the information of very important invisible part, made the accuracy of information to ensure.
Summary of the invention
The object of the invention is to propose a kind of method that solves invisible character transmission.
Concrete implementation is:
A kind of on the short message communication platform, realize the invisible character of transmission method: the correspondence table that all defines six codings and character visible at the communication transmitting terminal and the receiving terminal of note at first; The data that will transmit (eight codings) change into six codings; Search six codings and find out corresponding character visible with the correspondence table of character visible; SMS is transferred to information centre with character visible by note; Information centre finds out six corresponding codings with the character visible of receiving by six codings and the correspondence table of character visible; Six codings are converted into the initial data of eight codings by inverse operation.
Described eight codings are adopted and are converted into six codings in the following method:
(1) adds two zero before per six of group octet coding binary sequence;
(2) one group of new number is separated into a new byte by per eight, not enough eight back is with eight on spot patch foot.
Described eight coded datas will transmitting are invisible character.
Described eight coded datas will transmitting also can be character visible.
Pass through said method, after invisible character is six codings through code conversion, the front two of each six coding all is zero, so the value of each six coding is all in the scope of these 64 values of 0X00~0X3F, converting them to visible symbol according to code conversion table (value in the table all is a character visible) sends by note SMS, just solved the transmission problem of invisible character, in addition, character visible also can adopt aforesaid way, what transmit in transmission course like this is not original coding, has solved the problem of plaintext transmission poor stability simultaneously.
Embodiment
At first one group of information of vehicles (binary data, eight codings) is carried out six code conversion:
A byte (A) of binary data is expression like this:
A7,A6,A5,A4,A3,A2,A1,A0
Eight coded representations of the ABCD... of one group of binary data are:
A7,A6,A5,A4,A3,A2,A1,A0、B7,B6,B5,B4,B3,B2,B1,B0、C7,C6,C5,C4,C3,C2,C1,C0、D7,D6,D5,D4,D3,D2,D1,D0...
Carry out six codings: promptly add two 0 in per six front and by new eight as a new byte, eight of last byte less thaies mend enough eight with 0, be:
0,0,A7,A6,A5,A4,A3,A2//0,0,A1,A0、B7,B6,B5,B4//0,0,B3,B2,B1,B0,C7,C6//0,0,C5,C4,C3,C2,C1,C0//0,0,D7,D6,D5,D4,D3,D2//D1,D0...
Through each the byte front two after the conversion all is 0, so the span of a byte is in the scope of value of these 64 values of 0X00~0X3F.
To change each byte of back (0,0, b5, b4, b3, b2, among the b1, back 6 b5~b0 b0) and predefined code conversion table (following table) character visible carry out corresponding, b5, b4, b3 respectively corresponding first be listed as in three positions of each group.Three positions of each group in corresponding respectively first row of b2, b1, b0.Corresponding character in the table can be the character visible that is provided with arbitrarily, then forms one group of character visible by mapping like this.
000 | 001 | 010 | 011 | 100 | 101 | 110 | 111 | |
000 | 2E | 2C | 30 | 31 | 32 | 33 | 34 | 35 |
001 | 36 | 37 | 38 | 39 | 41 | 42 | 43 | 44 |
010 | 45 | 46 | 47 | 48 | 49 | 4A | 4B | 4C |
011 | 4D | 4E | 4F | 50 | 51 | 52 | 53 | 54 |
100 | 55 | 56 | 57 | 58 | 59 | 5A | 61 | 62 |
101 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 6A |
110 | 6B | 6C | 6D | 6E | 6F | 70 | 71 | 72 |
111 | 73 | 74 | 75 | 76 | 77 | 78 | 79 | 7A |
Character visible is passed to control centre by note SMS, and control centre looks into the code conversion table with the data of receiving, converts six codings to, by eight inverse operations of changeing six codings, converts six codings to original binary data.
The invention will be further described below in conjunction with instantiation:
As the data that will transmit be:
29 7f, 10 70 01 11 31 33 34 80 ef e3 20 (16 system)
Being converted to binary system is:
00101001 01111111 00010000 0111000 000000001 00010001 00110001
(29) (7f) (10) (70) (01) (11) (31)
00110011 00110100 10000000 11101111 11100011 0010000
(33) (34) (80) (ef) (e3) (20)
Converting six to is encoded to:
00001010 00010111 00111100 00010000 00011100 00000000
(0a) (17) (3c) (20) (2c) (00)
00000100 00010001 00001100 00010011 00001100 00110100 00100000
(04) (11) (0c) (13) (0c) (34) (20)
00001110 00111111 00100011 00001000 00000000
(0e) (3f) (23) (08) (00)
Look into conversion table and can get data:
38 4c 77 45 51 2e 32 46 41 48 41 6f 55 43 7a 58 36 2e
In this data corresponding A SCII code table:
“8LwEQ.2FAHAoUCzX6”
Vehicle sends this note to control centre, and middle the heart channel of Hang-Shaoyin inverse operation obtains data (29 7f, 10 7,001 11 31 33 34 80 ef e3 20).So just realized the transmission problem of invisible character, what transmit in transmission course simultaneously is not original coding, has solved the problem of plaintext transmission poor stability yet.
Aforesaid eight codings are converted into six Methods for Coding also can adopt existing other coding methods, now exemplifies two for example down:
(1) 64 system method
The data transaction of 16 systems is become the data of 64 systems.
2 byte conversion of the data of 16 systems become 64 systems with 3 byte representations.
For example: 16 system character strings: it is as follows that 27 00 29 41 7f ea b6 convert 64 system methods to:
To take out two bytes in order: 27 00
Its binary representation: 0,010 0,111 0,000 0000
Its 64 system is expressed as: 02 28 00
Take out two bytes again: 29 41
Its binary representation: 0,010 1,001 0,100 0001
Its 64 system is expressed as: 02 35 01
Take out two bytes again: 7f ea
Its binary representation: 0,111 1,111 1,110 1010
Its 64 system is expressed as: 07 63 42
Take out two byte: b6 00 (only remain a byte this moment, so fill a byte 00) again
Its binary representation: 1,011 0,110 0,000 0000
Its 64 system is expressed as: 11 24 00
So the data after the conversion are as follows: 02 28 00 02 35 01 07 63 42 11 24 00
(2) method of multibyte shuffling
Can adopt 6 byte conversion to become the method for 8 bytes.As the data number is not 6 multiple, can mend 0, makes it to become 6 multiple.
If any following data: 45 23 3e fe 40 00
Binary representation is as follows: 0,100 0101
0010 0011
0011 1110
1111 1110
0100 0000
0000 0000
Fetch data and fill in front by each binary data same position and can obtain 8 bytes for two 0:
00 000100(04)
00 100110(26)
00 011100(1c)
00 001100(0c)
00 001100(0c)
00 101100(2c)
00 011100(1c)
00 110000(30)
Claims (2)
1, a kind of method that realizes the invisible character of transmission on the short message communication platform is characterized in that: the correspondence table that at first defines six codings and character visible; The invisible character data of eight codings that will transmit changes into six codings; Search six codings and find out corresponding character visible with the correspondence table of character visible; By note character visible is transferred to control centre; Control centre finds out six corresponding codings with the character visible of receiving by six codings and the correspondence table of character visible; Six codings are converted into the invisible character data of eight codings by inverse operation.
2, a kind of method that on the short message communication platform, realizes the invisible character of transmission as claimed in claim 1, it is characterized in that: described eight codings are adopted and are converted into six codings in the following method:
Add two zero before per six of (1) one group octet coding binary sequence;
(2) one group of new number is separated into a new byte by per eight, not enough for eight eight on spot patch foot.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2003101177180A CN100435591C (en) | 2003-12-31 | 2003-12-31 | A method for implementing invisible character transmission on short message communication platform |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CNB2003101177180A CN100435591C (en) | 2003-12-31 | 2003-12-31 | A method for implementing invisible character transmission on short message communication platform |
Publications (2)
Publication Number | Publication Date |
---|---|
CN1635804A CN1635804A (en) | 2005-07-06 |
CN100435591C true CN100435591C (en) | 2008-11-19 |
Family
ID=34843700
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CNB2003101177180A Expired - Fee Related CN100435591C (en) | 2003-12-31 | 2003-12-31 | A method for implementing invisible character transmission on short message communication platform |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN100435591C (en) |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101840483B (en) * | 2009-03-17 | 2015-11-25 | 北大方正集团有限公司 | A kind of method and system of protecting computer document content |
CN105868194A (en) * | 2015-01-19 | 2016-08-17 | 阿里巴巴集团控股有限公司 | Methods and devices for text data compression and decompression |
CN105163294B (en) * | 2015-08-04 | 2018-10-26 | 恒宝股份有限公司 | A kind of channel compressions and decompression method and its device based on Cell Broadcast CB short message |
CN106454772B (en) * | 2015-08-13 | 2019-11-26 | 阿里巴巴集团控股有限公司 | The sending, receiving method and device of short message |
CN108009139A (en) * | 2017-11-30 | 2018-05-08 | 重庆金美通信有限责任公司 | A kind of decoding method of invisible character data circulation character visible data flow |
CN110266436B (en) * | 2019-06-26 | 2021-11-23 | 重庆金美通信有限责任公司 | Binary data stream transmission method based on Beidou |
CN113094609A (en) * | 2021-06-08 | 2021-07-09 | 北京泰迪熊移动科技有限公司 | Data processing method, device and storage medium |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1344462A (en) * | 2000-01-19 | 2002-04-10 | 皇家菲利浦电子有限公司 | Invisable coding of element information |
DE10059941A1 (en) * | 2000-12-02 | 2002-06-06 | Akomo Gmbh | Control information transmission method and device uses short message service for transmitting control information to program-controlled device |
WO2003007182A1 (en) * | 2001-07-11 | 2003-01-23 | Sendo International Limited | Device for automatically extending text messages, and methods therefor |
-
2003
- 2003-12-31 CN CNB2003101177180A patent/CN100435591C/en not_active Expired - Fee Related
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1344462A (en) * | 2000-01-19 | 2002-04-10 | 皇家菲利浦电子有限公司 | Invisable coding of element information |
DE10059941A1 (en) * | 2000-12-02 | 2002-06-06 | Akomo Gmbh | Control information transmission method and device uses short message service for transmitting control information to program-controlled device |
WO2003007182A1 (en) * | 2001-07-11 | 2003-01-23 | Sendo International Limited | Device for automatically extending text messages, and methods therefor |
Also Published As
Publication number | Publication date |
---|---|
CN1635804A (en) | 2005-07-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US6100824A (en) | System and method for data compression | |
CN100435591C (en) | A method for implementing invisible character transmission on short message communication platform | |
CN101453221B (en) | Mapper based on bit weaving code modulation system and mapping process thereof | |
CN107561564B (en) | A kind of compression implementation method of big-dipper satellite information transmission | |
EP1326346A3 (en) | Turbo-coding with staged data transmission and processing | |
CN101321034A (en) | System and method for encoding and decoding in wireless communication systems | |
EP1278308A3 (en) | Forward link text compression in satellite messaging | |
Chang et al. | Hierarchical vector quantizers with table-lookup encoders | |
CN101299746B (en) | Method and device for mapping/de-mapping constellation as well as linear transformation constellation map | |
CN101599890B (en) | System and method for transmitting data in communication system | |
EP0991219A2 (en) | Concatenated error control method and system for uplink satellite transmission | |
WO2003017501A3 (en) | System and method for encoding and decoding data utilizing modified reed-solomon codes | |
CA2428788A1 (en) | Static information knowledge used with binary compression methods | |
CN108306714B (en) | LT code demodulation and decoding method under high-order modulation | |
Schnurr et al. | Achievable rates for the restricted half-duplex two-way relay channel under a partial-decode-and-forward protocol | |
WO2013182079A1 (en) | Short message transcoding method and device | |
EP1237316A3 (en) | Apparatus and method for coding / decoding channels in a mobile communication system | |
US9065789B2 (en) | Remote communication method | |
KR101127063B1 (en) | Computer readable medium recording data structure thereon including the hangul code linked with ascii, encoder and decoder using hangul code linked with ascii and method for encoding and dcoding usint the hangul code linked with ascii and computer readable medium recording program for performing the method | |
CN107248900A (en) | A kind of double relaying distribution LT code coding/decodings and transmission method | |
CN107276719B (en) | Number decimal number odd-even number identification method for communication system | |
CN102844988A (en) | Line coding method and apparatus | |
CN100437627C (en) | Data information encoding method | |
CN1941751B (en) | Method for receiving and sending character information by escaping in automatic shipped recognition system | |
US20050070224A1 (en) | Method of using external electronic device on fixed platform to operate short messages through mobile communication device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
C14 | Grant of patent or utility model | ||
GR01 | Patent grant | ||
CF01 | Termination of patent right due to non-payment of annual fee | ||
CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20081119 Termination date: 20211231 |