AU2002368407A1 - Automated method for compressing binary strings without information loss, and related automated method for decompressing - Google Patents

Automated method for compressing binary strings without information loss, and related automated method for decompressing

Info

Publication number
AU2002368407A1
AU2002368407A1 AU2002368407A AU2002368407A AU2002368407A1 AU 2002368407 A1 AU2002368407 A1 AU 2002368407A1 AU 2002368407 A AU2002368407 A AU 2002368407A AU 2002368407 A AU2002368407 A AU 2002368407A AU 2002368407 A1 AU2002368407 A1 AU 2002368407A1
Authority
AU
Australia
Prior art keywords
automated method
decompressing
information loss
binary strings
compressing binary
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.)
Abandoned
Application number
AU2002368407A
Inventor
Elena Leanza
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ATOP Innovation SpA
Original Assignee
ATOP Innovation SpA
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.)
Filing date
Publication date
Application filed by ATOP Innovation SpA filed Critical ATOP Innovation SpA
Publication of AU2002368407A1 publication Critical patent/AU2002368407A1/en
Abandoned legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • 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/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • 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
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • 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/3084—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method
    • H03M7/3088—Compression; Expansion; Suppression of unnecessary data, e.g. redundancy reduction using adaptive string matching, e.g. the Lempel-Ziv method employing the use of a dictionary, e.g. LZ78
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • 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
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • 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/42—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code using table look-up for the coding or decoding process, e.g. using read-only memory
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • 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/46—Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind
    • H03M7/48—Conversion to or from run-length codes, i.e. by representing the number of consecutive digits, or groups of digits, of the same kind by a code word and a digit indicative of that kind alternating with other codes during the code conversion process, e.g. run-length coding being performed only as long as sufficientlylong runs of digits of the same kind are present

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Compression, Expansion, Code Conversion, And Decoders (AREA)
AU2002368407A 2002-12-04 2002-12-04 Automated method for compressing binary strings without information loss, and related automated method for decompressing Abandoned AU2002368407A1 (en)

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/IT2002/000761 WO2004051862A1 (en) 2002-12-04 2002-12-04 Automated method for compressing binary strings without information loss, and related automated method for decompressing

Publications (1)

Publication Number Publication Date
AU2002368407A1 true AU2002368407A1 (en) 2004-06-23

Family

ID=32448850

Family Applications (1)

Application Number Title Priority Date Filing Date
AU2002368407A Abandoned AU2002368407A1 (en) 2002-12-04 2002-12-04 Automated method for compressing binary strings without information loss, and related automated method for decompressing

Country Status (2)

Country Link
AU (1) AU2002368407A1 (en)
WO (1) WO2004051862A1 (en)

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
ITRM20010304A1 (en) * 2001-06-01 2002-12-02 Atop Innovation Spa CODING METHOD, IN PARTICULAR OF NUMERICAL CODING.

Also Published As

Publication number Publication date
WO2004051862A1 (en) 2004-06-17

Similar Documents

Publication Publication Date Title
AU2003211448A1 (en) Server, information providing method and program
EP1575288B8 (en) Information processing device, information processing method and program, and recording medium
AU2003234763A1 (en) Coding device, decoding device, coding method, and decoding method
AU2003279156A1 (en) Data compression and decompression system and method
EP1578020A4 (en) Data compressing method, program and apparatus
AU2003206376A1 (en) Alphanumeric information input method
AU2001270575A1 (en) Improved huffman data compression method
AU2003234565A1 (en) Automated financial system and method
AU2001262249A1 (en) Method and device for compressing and/or decompressing data as well as for analyzing and representing data
AU2002236113A1 (en) Method, device and system for coding, processing and decoding odor information
HK1072318A1 (en) Reproducing apparatus, reproducing method, and disk manufacturing method
AU2002365521A1 (en) Information providing system, information providing method, and information providing program
AU2003243006A1 (en) Information processing method, information processing apparatus, program, and storage medium
AU2002368408A1 (en) Automated method for lossless data compression and decompression of a binary string
AU2002343876A1 (en) Woody molding, its production system and production method
AU2003211894A1 (en) Information distribution method, server, and program
AU2003247449A1 (en) Nano-ceramics and method thereof
AU2003264457A1 (en) Information processing device and method, program, and recording medium
AU2003227452A1 (en) Information processing device and method, recording medium, and program
AU2003252635A1 (en) Caseless, complete round and also a method of manufacturing such a caseless, complete round
AU2003242297A1 (en) Information processing device and method, recording medium, and program
EP1351183A3 (en) Sequence data combining method, apparatus and program
AU2003275549A1 (en) Information processing device, information processing method, information processing program, and medium
AU2003275829A1 (en) Method for information retrieval
AU2002368407A1 (en) Automated method for compressing binary strings without information loss, and related automated method for decompressing

Legal Events

Date Code Title Description
MK6 Application lapsed section 142(2)(f)/reg. 8.3(3) - pct applic. not entering national phase