DocumentCode :
534272
Title :
Research on Whole Max Ordinal in Combinatorics Coding Technology
Author :
Jun, Lu ; Daxin, Liu
Author_Institution :
Coll. of Comput. Sci. & Technol., Harbin Eng. Univ., Harbin, China
Volume :
1
fYear :
2010
fDate :
16-18 July 2010
Firstpage :
167
Lastpage :
170
Abstract :
Combinatorics coding is a new data coding method based on combinatorics. Ordinal computing is the core in the combinatorics coding technology and ordinal computing lies on whole max ordinal computing. So whole max ordinal in combinatorics coding technology is researched in this paper. At first, the combinatorics coding theory and the correlative basic concepts are described. Then, the property of the whole max ordinal is opened out by the correlative proved theorem. The research indicates that the length of the whole max ordinal is smaller than the length of the sequence, and the difference of the sequence length and the whole max ordinal length increases along with the increase of the sequence length. The research of the whole max ordinal is of great significance to the development of the combinatorics coding technology.
Keywords :
combinatorial mathematics; data compression; encoding; combinatorics coding technology; data coding method; sequence length; whole max ordinal computing; Benchmark testing; Computer science; Information technology; Optimization; Source coding; Combinatorics Coding; Data Coding; Data Compression; Source Coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology and Applications (IFITA), 2010 International Forum on
Conference_Location :
Kunming
Print_ISBN :
978-1-4244-7621-3
Electronic_ISBN :
978-1-4244-7622-0
Type :
conf
DOI :
10.1109/IFITA.2010.134
Filename :
5635140
Link To Document :
بازگشت