上官冲 (教授)

教授 博士生导师 硕士生导师

性别:男

毕业院校:浙江大学

学历:研究生(博士)毕业

学位:理学博士学位

在职信息:在职

所在单位:高等研究院、数学与交叉科学研究中心、非线性期望前沿科学研究中心

入职时间:2020-09-04

学科:应用数学

办公地点:山东大学青岛校区华岗苑东楼E208

电子邮箱:theoreming@163.com

   

个人简介


上官冲,山东大学数学与交叉科学研究中心教授、山东大学齐鲁青年学者(第一层次),分别于20126月、20176月获得浙江大学数学学院理学学士、博士学位,博士导师为葛根年教授,毕业后于20178月至20207月在以色列特拉维夫大学从事博士后研究工作,合作导师为Itzhak Tamo。主要从事组合数学与信息科学交叉领域的研究,已在组合数学顶级期刊《Journal of Combinatorial Theory, Series A》、《Journal of Combinatorial Theory, Series B》,理论计算机科学顶级会议《The Annual ACM Symposium on Theory of Computing (STOC)》,信息论顶级期刊《IEEE Transactions on Information Theory》,离散数学权威期刊《SIAM Journal on Discrete Mathematics》等国际知名期刊上发表论文十余篇。

 

目前,我的主要研究兴趣包括:极值组合(概率方法、多项式方法)、编码理论(Reed-Solomon码)、数据存储(纠删码、DNA存储)、信息安全(数字指纹、组合追踪方案)等方向。

 

本人与组合数学与信息交叉科学研究团队有长期的合作关系,欢迎有志于从事组合数学与信息科学研究的硕士生、博士生、博士后加盟团队。请发送邮件至gnge@zju.edu.cn(葛根年)、theoreming@163.com(上官冲)询问。


谷歌学术(Google scholar   英文主页(English version

 

发表论文


1.   Xin Wang, Hengjia Wei, Chong Shangguan, Gennian Ge, New bounds and constructions for multiplyconstant-weight codes, IEEE Transactions on Information Theory 62 (11), 6315-6327, 2016.

2.   Chong Shangguan, Gennian Ge, New bounds on the number of tests for disjunct matrices, IEEE Transactions on Information Theory 62 (12), 7518-7521, 2016.

3.   Chong Shangguan, Gennian Ge, Separating hash families: A Johnson-type bound and new construc-tions, SIAM Journal on Discrete Mathematics 30 (4), 2243-2264, 2016.

4.   Chong Shangguan, Xin Wang, Gennian Ge, Ying Miao, New bounds for frameproof codes, IEEE Transactions on Information Theory 63 (11), 7247-7252, 2017.

5.   Chong Shangguan, Jingxue Ma, Gennian Ge, New upper bounds for parent-identifying codes and traceability codes, Designs, Codes and Cryptography 86 (8), 1727-1737, 2018.

6.   Chong Shangguan, Yiwei Zhang, Gennian Ge, Centralized coded caching schemes: A hypergraphtheoretical approach, IEEE Transactions on Information Theory 64 (8), 5755-5766, 2018.

7.  Gennian Ge, Chong Shangguan, Xin Wang, Some intriguing upper bounds for separating hash families, Science China Mathematics, 62 (2), 269-282, 2019.

8.  Chong Shangguan, Gennian Ge, A new piggybacking design for systematic MDS storage codes, Designs, Codes and Cryptography 87, 2753-2770, 2019.

9.  Gennian Ge, Chong Shangguan, Maximum subsets of F^n_q containing no right angles, Journal of Algebraic Combinatorics (52), 455-460, 2020. 

10.  Noga Alon, Omri Ben-Eliezer, Chong Shangguan, Itzhak Tamo, The hat guessing number of graphs, Journal of Combinatorial Theory, Series B (144), 119-149, 2020. 

11.  Chong Shangguan, Itzhak Tamo, Degenerate Turán densities of sparse hypergraphs, Journal of Combinatorial Theory, Series A, available online.

12.  Chong Shangguan, Itzhak Tamo, Combinatorial list decoding of Reed-Solomon codes beyond the Johnson radiusProceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC 2020), 538-551, 2020.

13.  Chong Shangguan, Itzhak Tamo, Sparse hypergraphs with applications to coding theory, SIAM Journal on Discrete Mathematics, 34 (3), 1493-1504, 2020.

14.  Chong Shangguan, Itzhak Tamo, Error detection and error correction in communication graphs, 2020 IEEE International Symposium on Information Theory (ISIT2020), available online.

15.  Chong Shangguan, Itzhak Tamo, New Tur\'an exponents for two extremal hypergraph problems, SIAM Journal on Discrete Mathematics, to appear.

16.  Gennian Ge, Chong Shangguan, Sparse hypergraphs: new bounds and construction, Journal of Combinatorial Theory, Series B, to appear. 

17.   Zeyu Guo, Ray Li, Chong Shangguan, Itzhak Tamo, Mary Wootters, Reed-Solomon codes, disjoint tree packings and the nonsingularity of intersection matrices, manuscript.

18.   Chong Shangguan, On two hypergraph packing problems, manuscript.

19.   Chong Shangguan, Near optimal constructions of frameproof codes, manuscript.