Linear Independent Component Analysis Over Finite Fields: Algorithms and Bounds

DOI10.1109/TSP.2018.2872006zbMath1415.94199arXiv1809.05815OpenAlexW2891505418WikidataQ129246845 ScholiaQ129246845MaRDI QIDQ4622472

Amichai Painsky, Saharon Rosset, Meir Feder

Publication date: 12 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1809.05815

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (2)

Physiological constraints of visual pathway lead to more efficient coding of information in retina ⋮ Statistical Methods for Minimax Estimation in Linear Models with Unknown Design Over Finite Alphabets

This page was built for publication: Linear Independent Component Analysis Over Finite Fields: Algorithms and Bounds