Scribd
Upload
10 views

Tropical_regime

Uploaded by

haidangel29
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views

Tropical_regime

Uploaded by

haidangel29
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Linear congruence and Varshamov-Tenengol’ts codes

Traditional VT a (n) VT codes capable of correcting 1-edit:

x1 + 2x2 + . . . + nxn = a mod 2n + 1 (Levenshtein 1966)

Differential VT a (n, q) VT codes capable of correcting 1-deletion:

y1 +2y2 +. . .+nyn = a mod qn (T. Thanh Nguyen et al. 2022)

Our linear congruence q-adic codes capable of correcting 1-edit:

b x0 + qx1 + q 2 x2 + · · · + q n xn = c mod m

(Codes construction=Trellis construction (VNese), Dang Huy Ruan)
The bridge between Linear q-adic codes & VT codes
   
1 q
  2   q 2 
So.. how to map x1 x2 · · · xn ·  ..  → x1 x2 · · · xn · 
 
 ... 

.
n qn
We may use tropical arithmetics here. Rules are as follows:
Tropical addition: x ⊕ y := min (x, y )
Tropical multiplication: x ⊙ y := x + y
Hint: It’s all about logarithm.
2−x + 2−y ≈ 2− min(x,y ) , especially when |x − y | is big
2−x · 2−y = 2−(x+y )
For our problem: q n = q ⊙ q ⊙ · · · ⊙ q = nq
| {z }
n
(1, 2 · · · , n) 7→ q · (1, 2 · · · , n)

You might also like