Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

V. Y. F. Tan; L. Balzano; S. C. Draper

doi:10.1109/tit.2011.2178017

Rank Minimization Over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations

IEEE Transactions on Information Theory ◽

10.1109/tit.2011.2178017 ◽

2012 ◽

Vol 58 (4) ◽

pp. 2018-2039 ◽

Cited By ~ 11

Author(s):

V. Y. F. Tan ◽

L. Balzano ◽

S. C. Draper

Keyword(s):

Finite Fields ◽

Rank Minimization ◽

Fundamental Limits

Download Full-text

Rank minimization over finite fields

2011 IEEE International Symposium on Information Theory Proceedings ◽

10.1109/isit.2011.6033722 ◽

2011 ◽

Cited By ~ 5

Author(s):

Vincent Y. F. Tan ◽

Laura Balzano ◽

Stark C. Draper

Keyword(s):

Finite Fields ◽

Rank Minimization

Download Full-text

Information Theoretic Bounds for Tensor Rank Minimization over Finite Fields

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011 ◽

10.1109/glocom.2011.6133547 ◽

2011 ◽

Cited By ~ 1

Author(s):

A. Emad ◽

O. Milenkovic

Keyword(s):

Finite Fields ◽

Tensor Rank ◽

Rank Minimization ◽

Information Theoretic

Download Full-text

Finite Fields

10.1017/cbo9780511525926 ◽

1996 ◽

Cited By ~ 194

Author(s):

Rudolf Lidl ◽

Harald Niederreiter

Keyword(s):

Finite Fields

Download Full-text

Finite Fields and Applications

10.1017/cbo9780511525988 ◽

1996 ◽

Cited By ~ 2

Keyword(s):

Finite Fields

Download Full-text

Algebraic Curves over Finite Fields

10.1017/cbo9780511608766 ◽

1991 ◽

Cited By ~ 54

Author(s):

Carlos Moreno

Keyword(s):

Finite Fields ◽

Algebraic Curves ◽

Curves Over Finite Fields

Download Full-text

Maximum Distance Separable Hankel Rhotrices over Finite Fields

JOURNAL OF COMBINATORICS INFORMATION & SYSTEM SCIENCES ◽

10.32381/jciss.2018.43.1-4.2 ◽

2018 ◽

Vol 43 (1-4) ◽

pp. 13-45

Author(s):

Prof. P. L. Sharma ◽

◽

Mr. Arun Kumar ◽

Mrs. Shalini Gupta ◽

◽

...

Keyword(s):

Finite Fields ◽

Maximum Distance ◽

Maximum Distance Separable

Download Full-text

Deterministic Constructions of Compressed Sensing Matrices Based on Affine Singular Linear Space over Finite Fields

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences ◽

10.1587/transfun.e101.a.1957 ◽

2018 ◽

Vol E101.A (11) ◽

pp. 1957-1963 ◽

Cited By ~ 2

Author(s):

Gang WANG ◽

Min-Yao NIU ◽

Jian GAO ◽

Fang-Wei FU

Keyword(s):

Compressed Sensing ◽

Linear Space ◽

Finite Fields ◽

Compressed Sensing Matrices ◽

Sensing Matrices

Download Full-text

Notes on three-pass protocol

Herald of Omsk University ◽

10.24147/1812-3996.2020.25(4).4-9 ◽

2020 ◽

Vol 25 (4) ◽

pp. 4-9

Author(s):

Yerzhan R. Baissalov ◽

Ulan Dauyl

Keyword(s):

Finite Fields ◽

Matrix Algebras ◽

Associative Structures

The article discusses primitive, linear three-pass protocols, as well as three-pass protocols on associative structures. The linear three-pass protocols over finite fields and the three-pass protocols based on matrix algebras are shown to be cryptographically weak.

Download Full-text