Patents
Literature
1 results about "String group" patented technology
Efficacy Topic
Property
Owner
Technical Advancement
Application Domain
Technology Topic
Technology Field Word
Patent Country/Region
Patent Type
Patent Status
Application Year
Inventor
In topology, a branch of mathematics, a string group is an infinite-dimensional group String(n) introduced by Stolz (1996) as a 3-connected cover of a spin group. A string manifold is a manifold with a lifting of its frame bundle to a string group bundle. This means that in addition to being able to define holonomy along paths, one can also define holonomies for surfaces going between strings. There is a short exact sequence of topological groups 0→K(Z,2)→String(n)→Spin(n)→0 where K(Z, 2) is an Eilenberg–MacLane space and Spin(n) is a spin group.
Coding method and device for alternately encoding index representation string group and copy upper string
The present application provides a method and device for encoding and decoding a set of point vector index representation strings and a unit base vector string without using a flag bit, but automatically alternating the encoding. When encoding and decoding each set of point vector index representation strings, a variable called string number and its syntax element, which indicates how many point vector index representation strings in the set, is first encoded and decoded; then the point vector index representation strings in the set are encoded and decoded one by one, and the encoding and decoding of a unit base vector string is automatically started, and the encoding and decoding of the point vector index representation strings and the unit base vector string are alternated continuously until all the strings in the current compression unit are encoded and decoded. In this way, each unit base vector string can save a flag bit, and the point prediction encoding efficiency is effectively improved.
Owner:郭萍