Abstract: In the context of Complexity Reduction in Lattice-Based Information Retrieval, the reduction process must preserve the algebraic structure of a lattice. The SK (Sharma-Kaushik)-Lattices are known to be of high applicational value. Hence the present study is aimed at detailing the `Algebraic Structure of SK-Lattice. In the context of Information-Theoretic approach to coding, the n-tuples of integers are relevant. Therefore, the Algebraic properties are obtained for lattices of SK-partitions, which are characterized as n-tuples of integers. Such lattices are shown to satisfy the Jordan-Dedekind chain condition and the modular-identity. Right residuals and deficits are also considered.