During the last years the theory of compressive sensing has found significant utility in the digital holography realm. In this letter we summarize and extend our previous theoretical results which determine the relati...During the last years the theory of compressive sensing has found significant utility in the digital holography realm. In this letter we summarize and extend our previous theoretical results which determine the relation between the number of Fresnel samples required on the object illumination type, illumination wavelength, imaging geometry and sensor＇s size and resolution.展开更多
Two authentication codes with arbitration (A 2 codes) are constructed from finite affine spaces to illustrate for the first time that the information theoretic lower bounds for A 2 codes can be strictly tighter t...Two authentication codes with arbitration (A 2 codes) are constructed from finite affine spaces to illustrate for the first time that the information theoretic lower bounds for A 2 codes can be strictly tighter than the combinatorial ones. The codes also illustrate that the conditional combinatorial lower bounds on numbers of encodingdecoding rules are not genuine ones. As an analogue of 3 dimensional case, an A 2 code from 4 dimensional finite projective spaces is constructed, which meets both the information theoretic and combinatorial lower bounds.展开更多
文摘During the last years the theory of compressive sensing has found significant utility in the digital holography realm. In this letter we summarize and extend our previous theoretical results which determine the relation between the number of Fresnel samples required on the object illumination type, illumination wavelength, imaging geometry and sensor＇s size and resolution.
文摘Two authentication codes with arbitration (A 2 codes) are constructed from finite affine spaces to illustrate for the first time that the information theoretic lower bounds for A 2 codes can be strictly tighter than the combinatorial ones. The codes also illustrate that the conditional combinatorial lower bounds on numbers of encodingdecoding rules are not genuine ones. As an analogue of 3 dimensional case, an A 2 code from 4 dimensional finite projective spaces is constructed, which meets both the information theoretic and combinatorial lower bounds.
