有限模框架

Finite Modular Frames

研究有限生成Hilbert C*-模中的模框架,来源于信息论中的数据包编码理论.我们计算出模框架的势,刻画了在框架向量丢失的情况下模框架的稳健性和最框优架,得到了由一个或两个酉算子生成的酉系统的Parseval模框架向量的特征.

This paper is devoted to studying modular frames for finitely generated Hilbert C*-modules.This research is motivated by the packets encoding technique in the information theory.We study the frame potential for modular frames,describe the robustness under the erasures of frame vectors,and investigate the optimal modular frames under l-erasure.At last,we describe the Parseval modular frame vectors for a unitary system generated by one or two unitary operators on a Hilbert C*-module.