二维字母数组的唯一键-Auniquekeyforatwodimensionalarrayofletters

3  

You need to take into account the size of alphabet. If code and indices are all zero based it would be:

您需要考虑字母表的大小。如果代码和索引都是零,那么它将是:

key = Sum(code(letter)*pow(L, r*C+c))

where L is the number of letters and C is the number of columns. However watch out for numeric overflow. For larger alphabets or matrices you need to use one of the following:

其中L是字母数,C是列数。但请注意数字溢出。对于较大的字母或矩阵,您需要使用以下之一:

• Lessen the requirement of keys being unique and use a hash (hash combiner).

减少密钥唯一的要求并使用散列(散列组合器)。

• Larger number type for the key or even unlimited arithmetic type such as in GMP lib.

键的数字类型更大,甚至是无限的算术类型,例如GMP lib。

• Compression such as arithmetic coding if the distribution of letters is not even. However you still run into the risk of not being able to fit / compress specific matrix into the key.

如果字母的分布不均匀,则算术编码等压缩。但是,您仍然存在无法将特定矩阵拟合/压缩到密钥中的风险。