|
|
发表于 2025-12-2 18:15:48
|
显示全部楼层
成电刘姝副教授，12篇TIT，今年才拿到博导资格，这水平不吊锤这个来养老的？# I) _. @8 L* N1 A
Encoding and Decoding of Reed–Muller Codes With Quasi-Linear Complexity) m# H: N0 ]0 z+ a" W+ ~
Yi Kuang;
( _2 v, f/ |) o" k3 ?( D4 g( dSongsong Li;! ]! p- O' [8 ]
Shu Liu;, ]* U; k: s" J/ ]" j/ V
Liming Ma;
/ X2 W, |6 t2 s1 TChaoping Xing7 v/ n" [% a: l! C
IEEE Transactions on Information Theory
$ j# A% L0 m$ t. ? uYear: 2025 | Volume: 71, Issue: 12 | Journal Article | Publisher: IEEE2 Z5 d, U% A# s7 z
: `7 y" a7 s2 [* s% r9 ]1 q! U. FAbstract
& q$ y7 C5 F+ v$ yHTML
5 v! e6 ~# A G$ Z& ?$ {) m. v3 i3 @5 ^ n. K) I/ k
Encoding of Algebraic Geometry Codes With Quasi-Linear Complexity O(NlogN)
6 T' C5 Z4 H- q( D) L" K. N- W0 x4 fSongsong Li;
& H) A1 Z8 I* o S I6 K4 V1 B/ A( iShu Liu;- `8 y9 m* m. e
Liming Ma;
7 |* _" m" H7 V; v4 R1 b6 ]) z( oYunqi Wan;
0 Q9 ]1 Z# m$ r# {5 v" NChaoping Xing0 F: [2 q! ?0 z: w7 j3 h6 K c! O
IEEE Transactions on Information Theory
; m% r3 l. f3 ~# ]+ [Year: 2025 | Volume: 71, Issue: 7 | Journal Article | Publisher: IEEE
( w, E3 D; s! W1 Y1 t' \
# U' x) a* ?+ m3 C' iAbstract3 y) a0 a( O2 z8 x) X) H
HTML2 j6 Y# R0 j$ p
2 g! E: s* M0 uExplicit Construction of q-Ary 2-Deletion Correcting Codes With Low Redundancy
' ]# f% q5 }8 |6 s4 AShu Liu;- S7 G8 j' s; y) n4 ?* P, E4 y
Ivan Tjuawinata;; ?. D5 B$ g5 ]; ~
Chaoping Xing
, x) w) |3 e% q. I1 v; XIEEE Transactions on Information Theory- q" E3 _. V" l
Year: 2024 | Volume: 70, Issue: 6 | Journal Article | Publisher: IEEE, ?7 S: x9 h9 ^; }/ l: _/ `% ?
Cited by: Papers (4)7 @+ S+ e" n, u8 k: `1 L7 r
" m- Q5 E- K! D9 m; `8 YAbstract6 E2 c% L- {! D* H. j! ?' |
HTML
+ b! ]1 N+ E* n1 T. t6 i" w) n; B' r; U; A$ q9 J7 T
A Lower Bound on the List-Decodability of Insdel Codes
5 B- R B! y. VShu Liu;
/ U$ J5 |/ ~% V; H7 M( }: _Ivan Tjuawinata;9 M; i z4 Z; c O# l
Chaoping Xing. M/ l# f& h! b7 j' y
IEEE Transactions on Information Theory- t# {) A1 u# h" f. w
Year: 2023 | Volume: 69, Issue: 11 | Journal Article | Publisher: IEEE
& q) B T$ ^% T6 R2 G, ~& [8 B$ A5 l# A8 c' W' w/ P2 f
Abstract
0 J4 c6 ?2 Z+ b! ]HTML
& Z6 {; O8 U/ k6 ~
- x# I& G7 I! E; s4 ~A New Construction of Nonlinear Codes via Algebraic Function Fields+ m+ u+ j# U. V5 r& N. N
Shu Liu;
* Y2 z# k! W0 T( y, v) S, k$ pLiming Ma;9 V6 A/ | x: Q% E4 ]
Ting-Yi Wu;
* i r) I' k0 j2 I9 ]: IChaoping Xing# F9 d4 T- b: Z
IEEE Transactions on Information Theory
! I {' p0 j9 H6 m1 j( iYear: 2023 | Volume: 69, Issue: 9 | Journal Article | Publisher: IEEE2 Q5 N. I9 [& K l
Cited by: Papers (1)7 T/ i+ U: W9 E* |
7 C) H0 h" T4 T. i nAbstract
, |" }! j; {/ t8 LHTML
2 y% o# g( j7 Z; L5 N) h/ }' h' J0 w1 b* ]* k4 ~9 T* ?7 z
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems
$ j4 E: P; C; j! kShu Liu;( h& m3 q2 r& W7 }
Chaoping Xing
* O( b' L! D& |2 J( yIEEE Transactions on Information Theory
$ \ d V, \: z2 J) W! `Year: 2023 | Volume: 69, Issue: 4 | Journal Article | Publisher: IEEE" T7 Q& v" r0 I
Cited by: Papers (2) o! f V' H" B# a, m. O
3 M; R- t9 {) s
Abstract
8 F7 g9 B4 _4 XHTML
% z9 U! o9 ^% ]
+ X) @- I5 O- O% m. o9 k; LBounds and Constructions for Insertion and Deletion Codes3 B; r' p' X3 \3 }% P
Shu Liu;1 F5 ^4 l, I( p) D) |
Chaoping Xing
; r9 ]# S: d# X4 G3 z; wIEEE Transactions on Information Theory
6 T' r( n+ |( NYear: 2023 | Volume: 69, Issue: 2 | Journal Article | Publisher: IEEE+ L3 |$ Q' o, U2 _2 M- H
Cited by: Papers (14)" K% j! e3 ~/ r! B$ O, F
! \/ F5 I9 C \2 T ~) o4 H, ?
Abstract# u1 k5 n3 m4 P. M* C4 l
HTML Q, P! [8 x. k2 a2 E
' L/ c" S3 f9 n
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation6 m! t1 Z# U& j. ?! Y# q, I6 z
Shu Liu;
5 [% W7 t f$ O- DIvan Tjuawinata; l$ J* X7 j0 ]: [* y7 q' D
Chaoping Xing
( y' B" |' D- F; e: `" q( W1 SIEEE Transactions on Information Theory4 o% X+ M3 z- c3 N% d" Q
Year: 2021 | Volume: 67, Issue: 9 | Journal Article | Publisher: IEEE
# V' F/ j+ C1 }9 aCited by: Papers (6)
" p3 F3 l; S) d# R' k1 L) Z. y' D6 U8 p
Abstract' z" Z5 W5 P: F+ @- o
HTML
6 v9 ^/ \# [& L9 @5 \7 X- Q
- v7 |. R% [, _4 m0 v# }) mExplicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime" j( b. N/ q5 G% `) r' |) S x
Tai Do Duc;
/ N: `! Y. c# hShu Liu;6 i$ X! i. }0 R3 G8 @2 o
Ivan Tjuawinata;
) H: ]" F D- _% e' gChaoping Xing
7 {& N8 X. y+ r. BIEEE Transactions on Information Theory1 r7 w/ u$ a# v& l7 U+ p
Year: 2021 | Volume: 67, Issue: 5 | Journal Article | Publisher: IEEE+ H9 A/ H* |) Y- K# L O
Cited by: Papers (17). M& ^+ ^# y- v: f
' `8 Q# O- {1 J+ BAbstract( e' Y0 |% J K8 @4 k! m; [
HTML
+ ?) o- T9 K6 Y0 j/ {4 Q0 F% z$ j5 q8 @5 b
List Decodability of Symbol-Pair Codes
: j# E- w. M3 fShu Liu;! u+ j+ P( y2 m- B8 I, ]
Chaoping Xing;: A$ @ c7 n- `. g& e
Chen Yuan
; M, f; x+ z, I6 T$ y1 G: E7 [IEEE Transactions on Information Theory. _7 `* h0 @/ [, z8 c O
Year: 2019 | Volume: 65, Issue: 8 | Journal Article | Publisher: IEEE
- `1 |" B; y/ E6 A& V2 GCited by: Papers (15)6 a) F# u* B% j$ D
7 o. x% R) o) c1 N U# DAbstract
$ L/ ^& H3 X5 R) t3 H3 X5 J1 x6 zHTML% E$ E4 x5 t i" U' N& ~
6 ^3 H( i" t3 E) rList Decoding of Cover Metric Codes Up to the Singleton Bound! |' G& E; w' b" r! _4 S M
Shu Liu;
9 \. p+ t/ V) J. w" fChaoping Xing;
8 O# y C7 i7 p0 ]" v+ R- \ V+ }Chen Yuan
. @0 C* @6 p. F3 d6 v6 w, X, HIEEE Transactions on Information Theory
1 M9 s% [! Q/ A+ V2 }" Q0 yYear: 2018 | Volume: 64, Issue: 4 | Journal Article | Publisher: IEEE5 V' T4 i9 A' Z/ `3 G+ x
Cited by: Papers (7)% \ u" K( i4 V/ u, {! c8 n8 t
' a$ S2 r* {4 z/ ?8 H5 H# p
Abstract
2 w% ^: C1 }3 g/ k# s% i- iHTML
: s0 |# s" h1 |/ {. u- ?; g) ?% E+ S* M+ r& e8 B* _$ q! H0 m9 W
List Decodability of Random Subcodes of Gabidulin Codes
3 ~6 p9 ~# D9 i: S; l5 _Shu Liu; Z8 |, } _- f/ Q% \5 b" b, k. U
Chaoping Xing;8 ^! |& _* U' ^- ]
Chen Yuan
: W1 c! ?8 P* E7 e0 Y A. h3 p0 yIEEE Transactions on Information Theory
: T0 I& J0 a" h. `Year: 2017 | Volume: 63, Issue: 1 | Journal Article | Publisher: IEEE
# _% W" C. ^' `% K* oCited by: Papers (5)2 ^; N i3 e6 A$ T7 v
|
|
[复制链接]
发表于 2025-12-2 11:45:36
楼主
