PATENT CLAIM ANALYSIS

Application Number: 16198338
Application Type: Utility
Filing Date: 2018-11
Publication Date: 2019-03
Patent Classification: ["341", "050000"]

Abstract:
Decomposing a value range of the respective syntax elements into a sequence of n partitions with coding the components of z laying within the respective partitions separately with at least one by VLC coding and with at least one by PIPE or entropy coding is used to greatly increase the compression efficiency at a moderate coding overhead since the coding scheme used may be better adapted to the syntax element statistics. Accordingly, syntax elements are decomposed into a respective number n of source symbols s i  with i=1 . . . n, the respective number n of source symbols depending on as to which of a sequence of n partitions into which a value range of the respective syntax elements is sub-divided, a value z of the respective syntax elements falls into, so that a sum of values of the respective number of source symbols s i  yields z, and, if n>1, for all i=1 . . . n−1, the value of s i  corresponds to a range of the i th  partition.

Claim (Index 12):
The method of  claim 9 , wherein the source symbols from the first sequence and the source symbols from the second sequence correspond to different portions.

Metadata:
- Claim Count in Document: 71.0
- Percentile: 98.0
- Lexical Diversity: 2.4026
- Patent Class: 341.0
- Transitional Phrase Type: none
- Component Type: 0
- Foreign Priority: False
- Related Applications: ['16109953', '15479787', '15257606', '13940561', '14980671']

Analysis Scores:
- 35 USC 101 Eligibility (BERT): 0.7586763121779859
- 35 USC 102 Novelty (BERT): 0.6591291892958326
- Combined Prediction Score: 0.7487215998897706
- Mean Citation Score: 622.1033239999998
- Max Citation Score: 640.4362
- Similarity Product: 613.6046850498079

Labels:
- Claim Label 101: 1
- Claim Label 102: 1
- Claim Label 103: 1
- Claim Label 112: 1
- Combined Label: 1
- Label 101 Adjusted: 1

Dataset: test