“…The evaluation of computation complexity of MCTAS is similar to CTAS‐ISOC [29]. If T NICA , T L , T U and T ORI are used to denote the average computation time required to encode an index using NICA, DITC with the left index pair, DITC with the upper index pair and the original index rule, respectively, and the operations of T L are similar to T U (compare [29]), the total computation complexity of MCTAS is where N NICA , N L , N U and N ORI are the numbers of indices encoded by NICA, DITC with the left index pair, DITC with the upper index pair and the original index, respectively. Since the NICA coding scheme is exploited to check if the current index is the same as one of its neighbours and the original index rule encodes the current index with a flag code plus its original index directly, it is obvious that T NICA and T ORI are much less than T L .…”