In this paper, we consider minimal linear codes by a general construction of from q-ary functions. First, give necessary and sufficient conditions for codewords which are constructed functions to be minimal. Second, as applications, present three constructions codes. Constructions on in paper generalize some recent results Ding et al. (IEEE Trans. Inf. Theory 64(10), 6536–6545, 2018); Heng (Fin...

The puncturing and shortening techniques are two important approaches to constructing new linear codes from old ones. In the past 70 years, a lot of progress on technique has been made, many works punctured have done. Many families with interesting parameters obtained technique. However, little research done there only handful references shortened codes. first objective this paper is prove some...

Let k ? n be two positive integers and q a prime power. The basic question in minimal linear codes is to determine if there exists an [ , ] code. first objective of this paper present new sufficient necessary condition for minimal. Using condition, it easy construct or prove some are second use the partially give answer codes. third four classes codes, which generalize results about binary case...