The splitting-off operation has important applications for graph connectivity problems. Shikare, Dalvi, and Dhotre [splitting-off operation for binary matroids and its applications, Graphs and Combinatorics, \(27(6) (2011), 871–882\)] extended this operation to binary matroids. In this paper, we provide a sufficient condition for preserving \(n\)-connectedness of a binary matroid under the splitting-off operation.