出于推荐系统，我们考虑的问题，估计块常数二进制矩阵（大小$m \times n$）从稀疏和嘈杂的意见。观测值是在未知的行和列排列、擦除和错误之后从底层块常数矩阵中获得的。我们推导出上界和下界的可实现的错误概率。对于固定的擦除和错误概率，我们表明，存在一个恒定的$C_1$，这样，如果集群的大小小于$C_1 \ln(mn)$，那么对于任何算法的错误的概率接近一个$m, n \tends \infty$。另一方面，我们表明，一个简单的多项式时间算法给出的概率误差减小到零的集群大小大于$C_2 \ln(mn)$为一个合适的常数$C_2$。
英文摘要：
Motivated by recommendation systems, we consider the problem of estimating block constant binary matrices (of size $m \times n$) from sparse and noisy observations. The observations are obtained from the underlying block constant matrix after unknown row and column permutations, erasures, and errors. We derive upper and lower bounds on the achievable probability of error. For fixed erasure and error probability, we show that there exists a constant $C_1$ such that if the cluster sizes are less than $C_1 \ln(mn)$, then for any algorithm the probability of error approaches one as $m, n \tends \infty$. On the other hand, we show that a simple polynomial time algorithm gives probability of error diminishing to zero provided the cluster sizes are greater than $C_2 \ln(mn)$ for a suitable constant $C_2$.
Linear Network Coding for Two-Unicast-$Z$ Networks: A Commutative Algebraic Perspective and Fundamental Limits
我们考虑一个两个单播- $Z$网络的有向无环图的单位容量限制的边缘;两个单播- $Z$网络是一个特殊的情况下，两个单播网络的目的地之一具有先验的边信息的不想要的（干扰）的消息。本文通过证明广义网络共享界并不严格，向量线性码优于标量线性码，非线性码优于线性码，解决了两个单播- $Z$网络的网络编码极限问题.我们还开发了一个交换代数方法来推导线性网络编码的可扩展性结果，并通过对C. Wang et.例如，I. Wang et.和Shenvi et.关于速率$(1,1)$在网络中的可行性。
Finite-Blocklength ISAC Multiple Access: A Source-Channel Coding Perspective
National Mobile Communications Research Laboratory, Southeast University（东南大学国家移动通信实验室）；School of Cyber Science and Engineering, Southeast University（东南大学网络空间安全学院）；Department of Electrical and Electronic Engineering, University of Manchester（曼彻斯特大学电气与电子工程系）
A Synonymous Variational Perspective on the Rate-Distortion-Perception Tradeoff
Key Laboratory of Universal Wireless Communications, Ministry of Education, Beijing University of Posts and Telecommunications（信息与通信技术联合实验室，教育部，北京邮电大学）；State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications（网络与交换技术国家重点实验室，北京邮电大学）
