We consider the problem of secure distributed matrix multiplication (SDMM) in which a user wishes to compute product two matrices with assistance honest but curious servers. construct polynomial codes for SDMM by studying recently introduced combinatorial tool called degree table. For fixed partitioning, minimizing total communication cost code is equivalent <inline-formula xmlns:mml="http://ww...