Find unique permutations of a set with constraints on sequences

Question

I have a set of 11 items {A, B, ... J, K}. I would like to find 11 permutations so that:

1. Each permutation starts with a different item (e.g. the first with A, second with B...)
2. Each sequence of two items in the 11 permutations is unique (if the sequence AB appears in the first permutation, it must not appear in any of the other 10 permutations).

I would think this also means each permutation should end with a different item.

For instance, these two permutations are a start:

A,B,C,D,E,F,G,H,I,J,K
B,D,F,H,J,A,C,E,G,K,I

How could I find a solution?