Correct predictions are in blue. If we detect only a subset of a labelled sentence, we highlight the caught part as blue, the missing part light blue. False positives are in green and false negatives are in red.

Problem 055 (EFPA (Equidistant Frequency Permutation Arrays)) — Constraint detection

Informally , the problem is to find a set -LRB- optionally of maximal size -RRB- of codewords , such that any pair of codewords are Hamming distance $ d $ apart . Each codeword -LRB- which may be considered as a sequence -RRB- is made up of symbols from the alphabet $ \ -LCB- 1 , \ ldots , q \ -RCB- $ , with each symbol occurring a fixed number $ \ lambda $ of times per codeword . More precisely , the problem has parameters $ v $ , $ q $ , $ \ lambda $ , $ d $ and it is to find a set $ E$ of size $ v $ , of sequences of length $ q \ lambda $ , such that each sequence contains $ \ lambda $ of each symbol in the set $ \ -LCB- 1 , \ ldots , q \ -RCB- $ . For each pair of sequences in $ E$ , the pair are Hamming distance $ d $ apart -LRB- i.e. there are $ d $ places where the sequences disagree -RRB- .

Problem 055 (EFPA (Equidistant Frequency Permutation Arrays)) — Detection of the decisions and objects to be modeled

Informally , the problem is to find a set -LRB- optionally of maximal size -RRB- of codewords , such that any pair of codewords are Hamming distance $ d $ apart . Each codeword -LRB- which may be considered as a sequence -RRB- is made up of symbols from the alphabet $ \ -LCB- 1 , \ ldots , q \ -RCB- $ , with each symbol occurring a fixed number $ \ lambda $ of times per codeword . More precisely , the problem has parameters $ v $ , $ q $ , $ \ lambda $ , $ d $ and it is to find a set $ E$ of size $ v $ , of sequences of length $ q \ lambda $ , such that each sequence contains $ \ lambda $ of each symbol in the set $ \ -LCB- 1 , \ ldots , q \ -RCB- $ . For each pair of sequences in $ E$ , the pair are Hamming distance $ d $ apart -LRB- i.e. there are $ d $ places where the sequences disagree -RRB- .

Back to list