Efficient short message compression

A method for reconstructing a compressed short message, comprising, by a processor:

• receiving a compressed short message, the message comprising a plurality of fields;
• dividing the compressed short message into one or more sub-blocks;
• for each of the one or more sub-blocks:
• a) identifying positions of a number of text strings field, a cyclic redundancy check (CRC) code length field, and a CRC code field in that sub-block,
• b) extracting, from that sub-block, the CRC code length and the number of words (m) based on the identified positions,
• c) extracting, from that sub-block, the CRC code,
• d) extracting, from that sub-block, a first code representing a text string type of a text string following the first code,
• e) analyzing the first code to determine whether the text string was compressed using a library,
• f) upon determining that the text string was compressed using a library, extracting, from that sub-block, a predetermined number of least significant bits representative of an index corresponding to the text string in the library,
• g) using the CRC code to determine the index, and
• h) using the index to replace the predetermined number of least significant bits representative of the index in that sub-block with the text string.

A system for compressing a short message, the system comprising:

• a processor;
• and
• a computer-readable storage medium comprising one or more programming instructions that, when executed, will cause the processor to:
• receive a short message to be compressed, the short message comprising a plurality of text strings;
• divide the short message into plurality of sub-blocks, wherein a number of text strings in each of the plurality of sub-blocks is less than or equal to a predetermined number;
• compress each sub-block of the plurality of sub-blocks by:
• (a) identifying a type of a first text string in the sub-block;
• (b) identifying a code representing the type;
• (c) determining whether the first text string exists in a library;
• (d) upon determining that the first text string exists in the library,
• (d-1) determining an index representing an address location of a data entry corresponding to the first text string contained in memory,
• (d-2) extracting a predetermined number of least significant digits of the index, and
• (d-3) replacing the first text string in that sub-block with the code and the extracted predetermined number of least significant digits of the index;
• (e) upon determining that the first text string does not exist in the library,
• (e-1) formatting the first text string for communication to a receiving device, and
• (e-2) appending to the formatted first text string a code indicating that the library was not used to compress the text string;
• and
• (f) repeating (a)-(e) for each second text string in the sub-block;
• wherein at least one of the sub-blocks of the short message comprises a partially compressed sub-block in which at least one text string is compressed using the library and at least one text string is not compressed using the library.

A system for reconstructing a compressed short message, the system comprising:

• a processor;
• and
• a computer-readable storage medium comprising one or more programming instructions that, when executed, will cause the processor to:
• receive a compressed short message, the message comprising a plurality of fields;
• divide the compressed short message into one or more sub-blocks;
• for each of the one or more sub-blocks:
• a) identify positions of a number of text strings field, a cyclic redundancy check (CRC) code length field, and a CRC code field in that sub-block,
• b) extract, from that sub-block, the CRC code length and the number of words (m) based on the identified positions,
• c) extract, from that sub-block, the CRC code,
• d) extract, from that sub-block, a first code representing a text string type of a text string following the first code,
• e) analyze the first code to determine whether the text string was compressed using a library,
• f) upon determining that the text string was compressed using a library, extracting, from that sub-block, a predetermined number of least significant bits representative of an index corresponding to the text string in the library,
• g) use the CRC code to determine the index, and
• h) use the index to replace the predetermined number of least significant bits representative of the index in that sub-block with the text string.