CO4771137A1 - METHOD AND MEANS FOR THE MANAGEMENT OF INFORMATION - Google Patents
METHOD AND MEANS FOR THE MANAGEMENT OF INFORMATIONInfo
- Publication number
- CO4771137A1 CO4771137A1 CO97075264A CO97075264A CO4771137A1 CO 4771137 A1 CO4771137 A1 CO 4771137A1 CO 97075264 A CO97075264 A CO 97075264A CO 97075264 A CO97075264 A CO 97075264A CO 4771137 A1 CO4771137 A1 CO 4771137A1
- Authority
- CO
- Colombia
- Prior art keywords
- digits
- binary
- message
- character
- symbol
- Prior art date
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/40—Conversion to or from variable length codes, e.g. Shannon-Fano code, Huffman code, Morse code
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Automatic Analysis And Handling Materials Therefor (AREA)
- Signal Processing For Digital Recording And Reproducing (AREA)
- Analogue/Digital Conversion (AREA)
- Reduction Or Emphasis Of Bandwidth Of Signals (AREA)
Abstract
Un método para reducir el número de bits en un mensaje;el método comprende los pasos de: codificar un mensaje de acuerdo con un método de codificación de Huffman predefinido, de modo que se genera un mensaje comprimido; el mensaje comprimido (C) tiene un número de bits reducido; que se califica de manera que la codificación de Huffman se actualiza después de los siguientes pasos: recibir, por lo menos, un mensaje (S20, figura 1A) que comprende varios caracteres (A, B, C); calcular, para cada carácter, un valor (p) que indica una frecuencia relativa del carácter en, por lo menos, un mensaje (S40); asignar (S60) un primer símbolo de clave en código binario (H1 ) a un carácter con la frecuencia relativa más alta (p1 ); el símbolo de clave (H1 ) comprende varios dígitos binarios; seleccionar todos o sustancialmente todos los dígitos binarios en el primer símbolo de clave de código binario (H1 ) para un primer valor binario (0); asignar un símbolo único (H2 , H3 ) para cada carácter único restante para generar un primer mensaje codificado; el primer mensaje codificado consta de un primer conjunto de dígitos (Y), en donde los códigos binarios en cada símbolo ((H2 , H3 ) se seleccionan de manera que el número de dígitos que tiene el primer valor binario (0) se maximiza en el primer conjunto de dígitos (Y); codificar (S220 - S370, figura 3b, 3C) el primer conjunto de dígitos (Y) de manera que se genere un segundo conjunto (E) de dígitos binarios (ei , ei + 1); y seleccionar los dígitos (ei , ei + 1) en el segundo conjunto (E) de dígitos de manera que el número de dígitos que tiene el primer valor binario (0) en el segundo conjunto (E) es mayor que el número de dígitos que tiene el primer valor binario (0) en el primer conjunto (Y).A method of reducing the number of bits in a message, the method comprises the steps of: encoding a message according to a predefined Huffman encoding method, so that a compressed message is generated; the compressed message (C) has a reduced number of bits; which is qualified such that the Huffman encoding is updated after the following steps: receiving at least one message (S20, Figure 1A) comprising multiple characters (A, B, C); calculating, for each character, a value (p) indicating a relative frequency of the character in at least one message (S40); assigning (S60) a first binary code key symbol (H1) to a character with the highest relative frequency (p1); the key symbol (H1) comprises several binary digits; selecting all or substantially all of the binary digits in the first binary code key symbol (H1) for a first binary value (0); assign a unique symbol (H2, H3) for each remaining unique character to generate a first encoded message; the first encoded message consists of a first set of digits (Y), where the binary codes in each symbol ((H2, H3) are selected such that the number of digits that the first binary value (0) has is maximized by the first set of digits (Y); encode (S220 - S370, Figure 3b, 3C) the first set of digits (Y) so that a second set (E) of binary digits (ei, ei + 1) is generated; and select the digits (ei, ei + 1) in the second set (E) of digits so that the number of digits having the first binary value (0) in the second set (E) is greater than the number of digits that has the first binary value (0) in the first set (Y).
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
SE9604834A SE512613C2 (en) | 1996-12-30 | 1996-12-30 | Method and bodies for information management |
Publications (1)
Publication Number | Publication Date |
---|---|
CO4771137A1 true CO4771137A1 (en) | 1999-04-30 |
Family
ID=20405183
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CO97075264A CO4771137A1 (en) | 1996-12-30 | 1997-12-29 | METHOD AND MEANS FOR THE MANAGEMENT OF INFORMATION |
CO97075263A CO4771136A1 (en) | 1996-12-30 | 1997-12-29 | METHOD AND MEANS OF HANDLING INFORMATION |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CO97075263A CO4771136A1 (en) | 1996-12-30 | 1997-12-29 | METHOD AND MEANS OF HANDLING INFORMATION |
Country Status (15)
Country | Link |
---|---|
US (2) | US6218968B1 (en) |
EP (2) | EP0948845A1 (en) |
JP (2) | JP3960627B2 (en) |
KR (2) | KR100375278B1 (en) |
CN (2) | CN1108015C (en) |
AR (2) | AR008949A1 (en) |
AU (2) | AU739418B2 (en) |
BR (2) | BR9713795A (en) |
CO (2) | CO4771137A1 (en) |
EE (2) | EE9900324A (en) |
HK (2) | HK1027227A1 (en) |
MY (2) | MY118092A (en) |
SE (1) | SE512613C2 (en) |
TR (2) | TR199901513T2 (en) |
WO (2) | WO1998029954A1 (en) |
Families Citing this family (41)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
KR100293523B1 (en) * | 1998-02-25 | 2001-09-17 | 구본준, 론 위라하디락사 | Lcd |
US7981126B2 (en) * | 1999-04-16 | 2011-07-19 | Vital Access Corporation | Locking compression plate anastomosis apparatus |
KR100359118B1 (en) * | 2001-03-20 | 2002-11-04 | 주식회사 아름테크놀로지 | Lossless data compression method for uniform entropy data |
GB2378361B (en) * | 2001-08-01 | 2004-10-13 | Roke Manor Research | Method for compression of data |
FR2835665B1 (en) * | 2002-02-04 | 2004-04-02 | Canon Kk | CODING AND DECODING OF DIGITAL SIGNALS |
US6941412B2 (en) * | 2002-08-29 | 2005-09-06 | Sandisk Corporation | Symbol frequency leveling in a storage system |
US7212681B1 (en) * | 2003-01-15 | 2007-05-01 | Cisco Technology, Inc. | Extension of two-dimensional variable length coding for image compression |
US6961696B2 (en) * | 2003-02-07 | 2005-11-01 | Motorola, Inc. | Class quantization for distributed speech recognition |
US7194137B2 (en) * | 2003-05-16 | 2007-03-20 | Cisco Technology, Inc. | Variable length coding method and apparatus for video compression |
KR20050053996A (en) | 2003-12-03 | 2005-06-10 | 삼성전자주식회사 | Method and apparatus for decoding huffman code effectively |
US7454073B2 (en) | 2004-06-15 | 2008-11-18 | Cisco Technology, Inc. | Video compression using multiple variable length coding processes for multiple classes of transform coefficient blocks |
US7499595B2 (en) * | 2004-08-18 | 2009-03-03 | Cisco Technology, Inc. | Joint amplitude and position coding for photographic image and video coding |
US7471840B2 (en) * | 2004-08-18 | 2008-12-30 | Cisco Technology, Inc. | Two-dimensional variable length coding of runs of zero and non-zero transform coefficients for image compression |
US7471841B2 (en) | 2004-06-15 | 2008-12-30 | Cisco Technology, Inc. | Adaptive breakpoint for hybrid variable length coding |
US7499596B2 (en) | 2004-08-18 | 2009-03-03 | Cisco Technology, Inc. | Amplitude coding for clustered transform coefficients |
US7454076B2 (en) * | 2004-06-15 | 2008-11-18 | Cisco Technology, Inc. | Hybrid variable length coding method for low bit rate video coding |
US7492956B2 (en) * | 2004-08-18 | 2009-02-17 | Cisco Technology, Inc. | Video coding using multi-dimensional amplitude coding and 2-D non-zero/zero cluster position coding |
US7680349B2 (en) * | 2004-08-18 | 2010-03-16 | Cisco Technology, Inc. | Variable length coding for clustered transform coefficients in video compression |
US7620258B2 (en) * | 2004-08-18 | 2009-11-17 | Cisco Technology, Inc. | Extended amplitude coding for clustered transform coefficients |
EP1675031B1 (en) * | 2004-12-22 | 2010-01-06 | Telefonaktiebolaget L M Ericsson (Publ) | Watermarking computer program code by equivalent mathematical expressions |
US7242328B1 (en) * | 2006-02-03 | 2007-07-10 | Cisco Technology, Inc. | Variable length coding for sparse coefficients |
CN100468576C (en) * | 2007-05-30 | 2009-03-11 | 忆正存储技术(深圳)有限公司 | Flash memory data read-write processing method |
US20100081284A1 (en) * | 2008-09-29 | 2010-04-01 | Applied Materials, Inc. | Methods and apparatus for improving flow uniformity in a process chamber |
KR101582223B1 (en) * | 2009-02-05 | 2016-01-04 | 삼성전자주식회사 | Miss alignment Detecting structure and Method of Detecting Miss alignment of patterns using the same |
CN102811113B (en) * | 2012-07-12 | 2014-12-10 | 中国电子科技集团公司第二十八研究所 | Character-type message compression method |
US9135155B2 (en) | 2012-11-30 | 2015-09-15 | Sandisk Technologies Inc. | Storage and retrieval of shaped data |
US9575683B2 (en) | 2012-11-30 | 2017-02-21 | Sandisk Technologies Llc | Processing shaped data |
RU2510942C1 (en) * | 2012-12-05 | 2014-04-10 | Владимир Петрович Панов | Method of transmitting and receiving information |
RU2510941C1 (en) * | 2012-12-05 | 2014-04-10 | Владимир Петрович Панов | Information transmission and reception system |
US9165649B2 (en) | 2013-12-20 | 2015-10-20 | Sandisk Technologies Inc. | Systems and methods of shaping data |
WO2015112167A1 (en) * | 2014-01-24 | 2015-07-30 | Hewlett-Packard Development Company, L.P. | Bit-flip coding |
CN105022674B (en) * | 2014-04-25 | 2019-02-01 | 群联电子股份有限公司 | Coding/decoding method, memory storage apparatus, memorizer control circuit unit |
JP6511752B2 (en) * | 2014-09-19 | 2019-05-15 | カシオ計算機株式会社 | Encoding apparatus, encoding method, decoding apparatus, decoding method, and program |
US10074427B2 (en) | 2014-11-12 | 2018-09-11 | Sandisk Technologies Llc | Shaped data associated with an erase operation |
US9912352B1 (en) * | 2017-06-06 | 2018-03-06 | Western Digital Technologies, Inc. | Hamming distance based binary representations of numbers |
US10719339B2 (en) * | 2017-10-18 | 2020-07-21 | Bank Of America Corporation | Computer architecture for emulating a quantizer in a correlithm object processing system |
US10727872B2 (en) * | 2018-01-10 | 2020-07-28 | Western Digital Technologies, Inc. | Encoding and decoding of hamming distance-based binary representations of numbers |
CN109979540B (en) * | 2018-11-29 | 2023-05-05 | 天津大学 | DNA information storage coding method |
US10826536B1 (en) * | 2019-10-03 | 2020-11-03 | International Business Machines Corporation | Inter-chip data transmission system using single-ended transceivers |
GB2593691B (en) * | 2020-03-30 | 2022-08-24 | Imagination Tech Ltd | Efficient encoding methods |
WO2023236128A1 (en) * | 2022-06-09 | 2023-12-14 | Huawei Technologies Co., Ltd. | Apparatus and methods for source coding and channel coding of low entropy signals |
Family Cites Families (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US3651459A (en) * | 1970-05-15 | 1972-03-21 | Philco Ford Corp | Character distance coding |
US4168513A (en) * | 1977-09-12 | 1979-09-18 | Xerox Corporation | Regenerative decoding of binary data using minimum redundancy codes |
US4396906A (en) * | 1980-10-31 | 1983-08-02 | Sri International | Method and apparatus for digital Huffman encoding |
US4516246A (en) * | 1982-02-26 | 1985-05-07 | Prentice Corporation | Data compression system |
US4546342A (en) * | 1983-12-14 | 1985-10-08 | Digital Recording Research Limited Partnership | Data compression method and apparatus |
US4535320A (en) * | 1984-06-22 | 1985-08-13 | Digital Recording Research Limited Partnership | Method and apparatus for digital Huffman decoding |
US4646061A (en) * | 1985-03-13 | 1987-02-24 | Racal Data Communications Inc. | Data communication with modified Huffman coding |
US4899149A (en) * | 1986-02-28 | 1990-02-06 | Gary Kahan | Method of and apparatus for decoding Huffman or variable-length coees |
GB8717124D0 (en) * | 1987-07-20 | 1987-08-26 | British Telecomm | P c m signal coding |
US4841299A (en) * | 1987-08-31 | 1989-06-20 | Digital Recording Research Limited Partnership | Method and apparatus for digital encoding and decoding |
US4813056A (en) * | 1987-12-08 | 1989-03-14 | General Electric Company | Modified statistical coding of digital signals |
JPH0834432B2 (en) * | 1989-01-31 | 1996-03-29 | 三菱電機株式会社 | Encoding device and encoding method |
US5254990A (en) * | 1990-02-26 | 1993-10-19 | Fujitsu Limited | Method and apparatus for compression and decompression of data |
JP2697479B2 (en) * | 1992-04-17 | 1998-01-14 | 国際電信電話株式会社 | Reversible variable length coding |
EP0582907A3 (en) * | 1992-08-10 | 1995-05-10 | Stac Electronics Inc | Data compression apparatus and method using matching string searching and Huffman encoding. |
GB9224893D0 (en) * | 1992-11-27 | 1993-01-13 | Philips Electronics Nv | Encoding and decoding data |
KR100186915B1 (en) * | 1994-07-13 | 1999-05-01 | 모리시다 요이치 | Digital coding/decoding apparatus using variable length codes |
US6373412B1 (en) * | 2000-12-15 | 2002-04-16 | International Business Machines Corporation | Fast JPEG huffman encoding and decoding |
-
1996
- 1996-12-30 SE SE9604834A patent/SE512613C2/en not_active IP Right Cessation
-
1997
- 1997-12-18 WO PCT/SE1997/002158 patent/WO1998029954A1/en active IP Right Grant
- 1997-12-18 BR BR9713795-2A patent/BR9713795A/en not_active Application Discontinuation
- 1997-12-18 KR KR10-1999-7006002A patent/KR100375278B1/en not_active IP Right Cessation
- 1997-12-18 WO PCT/SE1997/002159 patent/WO1998029955A1/en active IP Right Grant
- 1997-12-18 EE EEP199900324A patent/EE9900324A/en unknown
- 1997-12-18 JP JP52991698A patent/JP3960627B2/en not_active Expired - Fee Related
- 1997-12-18 AU AU55810/98A patent/AU739418B2/en not_active Ceased
- 1997-12-18 BR BR9713639-5A patent/BR9713639A/en not_active Application Discontinuation
- 1997-12-18 CN CN97181989A patent/CN1108015C/en not_active Expired - Fee Related
- 1997-12-18 CN CN97181993A patent/CN1100390C/en not_active Expired - Fee Related
- 1997-12-18 EE EEP199900325A patent/EE04409B1/en not_active IP Right Cessation
- 1997-12-18 EP EP97952147A patent/EP0948845A1/en not_active Withdrawn
- 1997-12-18 EP EP97952148A patent/EP0948846A1/en not_active Withdrawn
- 1997-12-18 KR KR10-1999-7006001A patent/KR100378319B1/en not_active IP Right Cessation
- 1997-12-18 JP JP52991598A patent/JP3995106B2/en not_active Expired - Lifetime
- 1997-12-18 AU AU55811/98A patent/AU730951B2/en not_active Ceased
- 1997-12-18 TR TR1999/01513T patent/TR199901513T2/en unknown
- 1997-12-18 TR TR1999/01505T patent/TR199901505T2/en unknown
- 1997-12-24 US US08/998,403 patent/US6218968B1/en not_active Expired - Lifetime
- 1997-12-24 US US08/997,771 patent/US6556151B1/en not_active Expired - Lifetime
- 1997-12-27 MY MYPI97006357A patent/MY118092A/en unknown
- 1997-12-29 CO CO97075264A patent/CO4771137A1/en unknown
- 1997-12-29 CO CO97075263A patent/CO4771136A1/en unknown
- 1997-12-30 MY MYPI97006410A patent/MY121639A/en unknown
- 1997-12-30 AR ARP970106262A patent/AR008949A1/en unknown
- 1997-12-30 AR ARP970106261A patent/AR014862A1/en unknown
-
2000
- 2000-09-27 HK HK00106150A patent/HK1027227A1/en not_active IP Right Cessation
- 2000-09-28 HK HK00106183A patent/HK1027228A1/en not_active IP Right Cessation
Also Published As
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CO4771137A1 (en) | METHOD AND MEANS FOR THE MANAGEMENT OF INFORMATION | |
DK0745254T3 (en) | Method of converting a series of information words of m bits into a modulated signal, method of generating a | |
US7190287B2 (en) | Method of generating Huffman code length information | |
ATE441251T1 (en) | METHOD AND SYSTEM FOR TRANSMITTING AND RECEIVING INFORMATION USING A CHAIN REACTION CODE | |
IL144594A0 (en) | Information additive group code generator and decoder for communication systems | |
AR019938A1 (en) | A DEVICE AND METHOD FOR CODING AND DECODING INFORMATION OF MULTIPLE WORDS BY INTERCALING IN FAVOR OF THE ADDRESS OF THE WORD AND THE STORAGE CARRIER | |
JPS61502511A (en) | Data compression device and method | |
KR900012443A (en) | Coding method | |
CN115941189B (en) | Encryption method for document data | |
Ezhilarasu et al. | Arithmetic Coding for Lossless Data Compression–A Review | |
ES2073450T3 (en) | CODING PROCEDURE AND VARIABLE LENGTH DECODING PROCEDURE, CODING DEVICE AND DECODING DEVICE FOR THE IMPLEMENTATION OF THIS PROCEDURE. | |
AR017944A1 (en) | DEVICE FOR CODING / DECODING A DATA BIT FLOW, THE RECORDING CARRIER OBTAINED AND THE METHOD OF CODING WITH THE PARACODING DEVICE | |
RU2006128528A (en) | DATA COMPRESSION METHOD | |
Turpin et al. | Housekeeping for prefix coding | |
KR970029015A (en) | Information encoding apparatus and method, information decoding apparatus and method, and information recording medium | |
KR20040087503A (en) | Data compression method for multi-byte character language | |
Howard et al. | Parallel lossless image compression using Huffman and arithmetic coding | |
Jaradat et al. | A Simple Binary Run‐Length Compression Technique for Non‐Binary Sources Based on Source Mapping | |
JPH1155125A (en) | Method for compressing and restoring character data | |
JPH10209877A (en) | Method for generating code and encoding method | |
Das et al. | Text Compression Method Using Hexapentabicentimal Number System | |
Istle et al. | Online compression of ASCII files | |
CN115208667A (en) | Method for realizing double encryption and decryption of chip and file through hybrid programming | |
Ryabko et al. | On asymptotically optimal methods of prediction and adaptive coding for Markov sources with unknown memory | |
Krichevskiy et al. | Rapid encoding of run lengths and pyramid cubic lattices |